APPROX
2008
Springer
14 years 1 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
APPROX
2008
Springer
14 years 1 months ago
2008
Springer
APPROX
2008
Springer
14 years 1 months ago
2008
Springer
We give an algorithm that with high probability properly learns random monotone DNF with t(n) terms of length log t(n) under the uniform distribution on the Boolean cube {0, 1}n ....
APPROX
2008
Springer
14 years 1 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
APPROX
2008
Springer
14 years 1 months ago
2008
Springer
We exhibit an explicit function f : {0,1}n {0,1} that can be computed by a nondeterministic number-on-forehead protocol communicating O(logn) bits, but that requires n(1) bits of...
APPROX
2008
Springer
14 years 1 months ago
2008
Springer
For every fixed 0, we give an algorithm that, given an n-vertex 3-uniform hypergraph containing an independent set of size n, finds an independent set of size n(2 ) . This improv...
APPROX
2008
Springer
14 years 1 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
APPROX
2008
Springer
14 years 1 months ago
2008
Springer
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
APPROX
2008
Springer
14 years 1 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
APPROX
2008
Springer
14 years 1 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...