Sciweavers

100 search results - page 3 / 20
» Upper Bounds for Vertex Cover Further Improved
Sort
View
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
13 years 9 months ago
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
Per Austrin, Subhash Khot, Muli Safra
DAM
2010
111views more  DAM 2010»
13 years 2 months ago
Covering line graphs with equivalence relations
An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph G is the minimum number of equivalence subgraphs needed to cover the edges of G. W...
Louis Esperet, John Gimbel, Andrew King
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
ESA
2010
Springer
172views Algorithms» more  ESA 2010»
13 years 3 months ago
Algorithmic Meta-theorems for Restrictions of Treewidth
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
Michael Lampis
9
Voted
ISAAC
2000
Springer
135views Algorithms» more  ISAAC 2000»
13 years 6 months ago
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
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...
Jianer Chen, Iyad A. Kanj