a ptas for the minimum weight connected vertex cover problem on unit disk graphs：一个ptas的最小重量连接顶点覆盖问题的单位圆盘图.pdfVIP

Theoretical Computer Science 571 (2015) 58–66 Contents lists available at ScienceDirect Theoretical Computer Science /locate/tcs A PTAS for the minimum weight connected vertex cover P 3 problem on unit disk graphs ✩ Limin Wang a , Xiaoyan Zhang a,b,∗, Zhao Zhang c , Hajo Broersma b a School of Mathematical Science Institute of Mathematics, Nanjing Normal University, Nanjing, 210023, China b Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands c College of Mathematics Physics and Information Engineering, Zhejiang Normal University, Zhejiang, Jinhua, 321004, China a r t i c l e i n f o a b s t r a c t Article history: Let G = (V , E ) be a weighted graph, i.e., with a vertex weight function w : V → R+ . We Received 3 July 2014 study the problem of determining a minimum weight connected subgraph of G that has at Received in revised form 24 November 2014 least one vertex in common with all paths of length two in G. It is known that this problem Accepted 10 January 2015 is NP-hard for general graphs. We first show that it remains NP-hard when restricted Available online 15 January 2015 Communicated by P. Widmayer to unit disk graphs. Our main contribution is a polynomial time approximation scheme for this problem if we assume that the problem is c-local and the unit disk graphs have Keyword