213
click to vote
APPROX
16 years 3 days ago
2004 Springer 
We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one. As applications, we get a 5/4-approximation algorithm for the (mi...
206
click to vote
APPROX
16 years 3 days ago
2004 Springer 
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
204
Voted
APPROX
16 years 3 days ago
2004 Springer
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...
198
click to vote
APPROX
16 years 3 days ago
2004 Springer
In standard property testing, the task is to distinguish between objects that have a property P and those that are ε-far from P, for some ε > 0. In this setting, it is perfec...
190
click to vote
APPROX
16 years 3 days ago
2004 Springer
Given any integer d ≥ 3, let k be the smallest integer such that d < 2k log k. We prove that with high probability the chromatic number of a random d-regular graph is k, k + 1...
|
Algorithms