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

13 years 6 months ago

Download www.utdallas.edu

Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial Time Approximation Scheme for CVC in Unit Disk Graph.

Zhao Zhang, Xiaofeng Gao, Weili Wu

Real-time Traffic

COCOA 2008 | Discrete Geometry | NP-hard Problem | Polynomial Time Approximation Scheme | Vertex Cover Problem |

claim paper

» ConstantFactor Approximation for MinimumWeight Connected Dominating Sets in Unit Disk Grap...

» Approximation Algorithms for Partial Covering Problems

» A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs

» Approximating the minimum clique cover and other hard problems in subtree filament graphs

» On connected domination in unit ball graphs

» Bidimensionality and geometric graphs

» Maintaining a Large Matching or a Small Vertex Cover

» Approximation Schemes for Minimum 2Connected Spanning Subgraphs in Weighted Planar Graphs

Post Info
More Details (n/a)

Added	18 Oct 2010
Updated	18 Oct 2010
Type	Conference
Year	2008
Where	COCOA
Authors	Zhao Zhang, Xiaofeng Gao, Weili Wu

Comments (0)

Sciweavers

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

COCOA 2008 | Discrete Geometry | NP-hard Problem | Polynomial Time Approximation Scheme | Vertex Cover Problem |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers