257
click to vote
APPROX
15 years 10 months ago
2008 Springer 
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
221
click to vote
APPROX
15 years 10 months ago
2008 Springer 
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
229
click to vote
APPROX
15 years 10 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...
230
click to vote
APPROX
15 years 10 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...
226
click to vote
APPROX
15 years 10 months ago
2008 Springer
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
|
Algorithms