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

Authors:
Zhao Zhang;Xiaofeng Gao;Weili Wu
Affiliations:
College of Mathematics and System Sciences, Xingjiang University, Urmuqi, China;Department of Computer Science, University of Texas at Dallas, Richardson, USA TX 75083;Department of Computer Science, University of Texas at Dallas, Richardson, USA TX 75083
Venue:
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Year:
2008

Citing 6
Cited 0

Ramsey numbers and an approximation algorithm for the vertex cover problem

Acta Informatica
Approximating the tree and tour covers of a graph

Information Processing Letters
Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane

GD '96 Proceedings of the Symposium on Graph Drawing
A 2-approximation NC algorithm for connected vertex cover and tree cover

Information Processing Letters
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks

Journal of Parallel and Distributed Computing - Special issue: Algorithms for wireless and ad-hoc networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Connected Vertex Cover Problem (CVC) is an $\mathcal 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.