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.

• Type: Conference
• Year: 2008
• Where: COCOA
• Authors: Zhao Zhang, Xiaofeng Gao, Weili Wu
• Keywords: COCOA 2008, Discrete Geometry, NP-hard Problem, Polynomial Time Approximation Scheme, Vertex Cover Problem