219 search results - page 3 / 44» A Better Approximation Ratio for the Vertex Cover Problem |

TCC

2007

Springer

13 years 8 months ago
2007

Springer

Private approximation of search problems deals with ﬁnding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...

ESA

2007

Springer

13 years 8 months ago
2007

Springer

We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...

WG

2007

Springer

13 years 8 months ago
2007

Springer

We study a variation of the vertex cover problem where it is required that the graph induced by the vertex cover is connected. We prove that this problem is polynomial in chordal g...

DCOSS

2008

Springer

13 years 4 months ago
2008

Springer

We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...

ICALP

2011

Springer

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