Abstract
Connected Vertex Cover Problem (CVC) is an \(\mathcal 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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abu-Khzam, F.N., et al.: Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. In: Proc.6th Workshop on Algorithm Engineering and Experiments & 1st Workshop on Analytic Algorithmics and Combinatorics, pp. 62–69 (2004)
Arkin, E.M., Halldorsson, M.M., Hassin, R.: Approximating the Tree and Tour Covers of a Graph. Inform. Process. Lett. 47, 275–282 (1993)
Bar-Yehuda, R., Even, S.: A local-ration Theorem for Approximating the Weighted Vertex Cover Problem, Analysis and Design of Algorithms for Combinatorial Problems. Annals of Discrete Mathematics 25, 27–46 (1985)
Cheng, X., Huang, X., Li, D., Wu, W., Du, D.: A polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks 42, 202–208 (2003)
Erlebach, T., Jansen, K., Seidel, E.: Polynomial-Time Approximation Schemes for Geometric Intersection Graphs. SIAM J. Comput. 34(6), 1302–1323 (2005)
Fujito, T., Doi, T.: A 2-Approximation NC Algorithm for Connected Vertex Cover and Tree Cover. Inform. Process. Lett. 90, 59–63 (2004)
Garey, M.R., Johnson, D.S.: The Rectilinear Steiner-Tree Problem is \(\mathcal{NP}\)-Complete. SIAM J. Appl. Math. 32, 826–834 (1977)
Hochbaum, D.H.: Approximation Algorithm for \(\mathcal{NP}\)-hard Problems, PWS, Boston, MA (1996)
Karp, R.M.: Reducibility among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)
Kratochvil, J.: Intersection graphs of noncrossing arc-connected sets in the plane. In: North, S.C. (ed.) GD 1996. LNCS, vol. 1190, pp. 257–270. Springer, Heidelberg (1997)
Li, X.Y., Wang, Y.: Simple Approximation Algorithms and PTASs for Various Problems in Wireless Ad-Hoc Networks. Journal of Parallel and Distributed Computing 66, 515–530 (2006)
Monien, B., Speckenmeyer, E.: Ramsey Numbers and an Approximation Algorithm for the Vertex Cover Problem. Acta Informatica 22, 115–123 (1985)
Papadimitriou, C.H., Yannakakis, M.: Optimization, Approximation, and Complexity Classes. J. Computer and System Sciences 43, 425–440 (1991)
Savage, C.: Depth-First Search and the Vertex Cover Problem. Inform. Process. Lett. 14, 233–235 (1982)
Wang, L.S., Jiang, T.: An approximation scheme for some Steiner tree problems in the plane. Networks 28(4), 187–193 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Z., Gao, X., Wu, W. (2008). Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph. In: Yang, B., Du, DZ., Wang, C.A. (eds) Combinatorial Optimization and Applications. COCOA 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85097-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-85097-7_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85096-0
Online ISBN: 978-3-540-85097-7
eBook Packages: Computer ScienceComputer Science (R0)