Sciweavers

Share
COCOA
2008
Springer

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

10 years 4 months ago
Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph
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
Added 18 Oct 2010
Updated 18 Oct 2010
Type Conference
Year 2008
Where COCOA
Authors Zhao Zhang, Xiaofeng Gao, Weili Wu
Comments (0)
books