986 search results - page 7 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
STOC
2002
ACM
14 years 7 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
NETWORKS
2006
13 years 7 months ago
2006
Abstract. The Steiner tree problem is to find a shortest subgraph that spans a given set of vertices in a graph. This problem is known to be NP-hard and it is well known that a pol...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery. We propose undirected and directed two-commodity flow formulations, which are bas...
ASIACRYPT
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...