PTAS for connected vertex cover in unit disk graphs

Authors:
Zhao Zhang;Xiaofeng Gao;Weili Wu
Affiliations:
College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang, 830046, China;Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA;Department of Computer Science, University of Texas at Dallas, Richardson, TX 75083, USA
Venue:
Theoretical Computer Science
Year:
2009

Citing 7
Cited 1

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
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
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

PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper gives the first polynomial time approximation scheme for the connected vertex cover problem in unit disk graphs.