APPROX
2010
Springer
14 years 7 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 7 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 7 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 7 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...
APPROX
2010
Springer
14 years 7 months ago
2010
Springer
APPROX
2010
Springer
14 years 7 months ago
2010
Springer
APPROX
2010
Springer
14 years 7 months ago
2010
Springer
APPROX
2010
Springer
14 years 7 months ago
2010
Springer
We consider two natural generalizations of the Asymmetric Traveling Salesman problem: the k-Stroll and the k-Tour problems. The input to the k-Stroll problem is a directed n-verte...
APPROX
2010
Springer
14 years 7 months ago
2010
Springer
APPROX
2010
Springer
14 years 7 months ago
2010
Springer
We prove that relative to an oracle, there is no worst-case to average-case reduction for NP. We also handle classes that are somewhat larger than NP, as well as worst-case to err...