Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

WG
2007
Springer

favoriteEmaildiscussreport

141views Theoretical Computer Science» more WG 2007»

Complexity and Approximation Results for the Connected Vertex Cover Problem

13 years 10 months ago

Complexity and Approximation Results for the Connected Vertex Cover Problem

Download www.lamsade.dauphine.fr

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 graphs, has a PTAS in planar graphs, is APX-hard in bipartite graphs and is 5/3-approximable in any class of graphs where the vertex cover problem is polynomial (in particular in bipartite graphs).

Bruno Escoffier, Laurent Gourvès, Jé

Real-time Traffic

Bipartite Graphs | Computer Science | Vertex Cover | Vertex Cover Problem | WG 2007 |

claim paper

Related Content

» Parameterized Complexity of Generalized Vertex Cover Problems

» Vertex and Edge Covers with Clustering Properties Complexity and Algorithms

» Parameterized Complexity of Vertex Cover Variants

» Connected Vertex Covers in Dense Graphs

» The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number

» Distributed and parallel algorithms for weighted vertex cover and other covering problems

» Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph

» Kernelization as Heuristic Structure for the Vertex Cover Problem

» Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Pr...

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	WG
Authors	Bruno Escoffier, Laurent Gourvès, Jérôme Monnot

Comments (0)