APPROX
2010
Springer
14 years 2 months ago
2010
Springer
: Let (C1, C1), (C2, C2), . . . , (Cm, Cm) be a sequence of ordered pairs of 2CNF clauses chosen uniformly at random (with repetition) from the set of all 4 n 2 clauses on n variab...
APPROX
2010
Springer
14 years 2 months ago
2010
Springer
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
APPROX
2010
Springer
14 years 2 months ago
2010
Springer
We initiate the study of on-line metric embeddings. In such an embedding we are given a sequence of n points X = x1, . . . , xn one by one, from a metric space M = (X, D). Our goal...
APPROX
2010
Springer
14 years 2 months ago
2010
Springer
APPROX
2010
Springer
14 years 2 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
APPROX
2010
Springer
14 years 2 months ago
2010
Springer
We study constraint satisfaction problems on the domain {-1, 1}, where the given constraints are homogeneous linear threshold predicates. That is, predicates of the form sgn(w1x1 +...
APPROX
2010
Springer
14 years 2 months ago
2010
Springer
A recurring theme in the literature on derandomization is that probabilistic algorithms can be simulated quickly by deterministic algorithms, if one can obtain impressive (i.e., s...
APPROX
2010
Springer
14 years 2 months ago
2010
Springer
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
APPROX
2010
Springer
14 years 2 months ago
2010
Springer
In this paper, we investigate whether a constant round Lasserre Semi-definite Programming (SDP) relaxation might give a good approximation to the UNIQUE GAMES problem. We show tha...
APPROX
2010
Springer
14 years 2 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...