57 search results - page 1 / 12» On Approximating Minimum Vertex Cover for Graphs with Perfec... |

ISAAC

2000

Springer

13 years 7 months ago
2000

Springer

It has been a challenging open problem whether there is a polynomial time approximation algorithm for the Vertex Cover problem whose approximation ratio is bounded by a constant l...

STOC

2009

ACM

14 years 4 months ago
2009

ACM

This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...

ISAAC

2007

Springer

13 years 10 months ago
2007

Springer

The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...

ICALP

2011

Springer

12 years 7 months ago
2011

Springer

In [13], Erd˝os et al. deﬁned the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...

APPROX

2008

Springer

13 years 6 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...