Sciweavers

219 search results - page 3 / 44
» A Better Approximation Ratio for the Vertex Cover Problem
Sort
View
TCC
2007
Springer
100views Cryptology» more  TCC 2007»
13 years 8 months ago
Private Approximation of Clustering and Vertex Cover
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...
Amos Beimel, Renen Hallak, Kobbi Nissim
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
13 years 8 months ago
Approximation of Partial Capacitated Vertex Cover
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...
Reuven Bar-Yehuda, Guy Flysher, Julián Mest...
WG
2007
Springer
13 years 8 months ago
Complexity and Approximation Results for the Connected Vertex Cover Problem
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...
Bruno Escoffier, Laurent Gourvès, Jé...
DCOSS
2008
Springer
13 years 4 months ago
Local PTAS for Independent Set and Vertex Cover in Location Aware Unit Disk Graphs
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...
Andreas Wiese, Evangelos Kranakis
ICALP
2011
Springer
12 years 6 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined 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 ...
Fabian Kuhn, Monaldo Mastrolilli