PTAS for connected vertex cover in unit disk graphs-Reference-Cited by-同舟云学术

PTAS for connected vertex cover in unit disk graphs

Published:2009-12 Issue:52 Volume:410 Page:5398-5402
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Zhang Zhao,Gao Xiaofeng,Wu Weili

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference14 articles.

1. Approximating the tree and tour covers of a graph;Arkin;Inform. Process. Lett.,1993

2. A local-ration theorem for approximating the weighted vertex cover problem, in: Analysis and Design of Algorithms for Combinatorial Problems;Bar-Yehuda;Ann. Discrete Math.,1985

3. A polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks;Cheng;Networks,2003

4. Polynomial-time approximation schemes for geometric intersection graphs;Erlebach;SIAM J. Comput.,2005

5. A 2-approximation NC algorithm for connected vertex cover and tree cover;Fujito;Inform. Process. Lett.,2004

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The connected vertex cover problem in k-regular graphs;Journal of Combinatorial Optimization;2019-03-19

2. An Efficient Heuristic Algorithm for Solving Connected Vertex Cover Problem;Mathematical Problems in Engineering;2018-09-06

3. Complexity and algorithms for the connected vertex cover problem in 4-regular graphs;Applied Mathematics and Computation;2017-05

4. Approximating connectivity domination in weighted bounded-genus graphs;Proceedings of the forty-eighth annual ACM symposium on Theory of Computing;2016-06-19

5. A PTAS for the minimum weight connected vertex cover P3 problem on unit disk graphs;Theoretical Computer Science;2015-03