PTAS for the minimum k-path connected vertex cover problem in unit disk graphs
- 436 Downloads
In the Minimum k-Path Connected Vertex Cover Problem (MkPCVCP), we are given a connected graph G and an integer k ≥ 2, and are required to find a subset C of vertices with minimum cardinality such that each path with length k − 1 has a vertex in C, and moreover, the induced subgraph G[C] is connected. MkPCVCP is a generalization of the minimum connected vertex cover problem and has applications in many areas such as security communications in wireless sensor networks. MkPCVCP is proved to be NP-complete. In this paper, we give the first polynomial time approximation scheme (PTAS) for MkPCVCP in unit disk graphs, for every fixed k ≥ 2.
KeywordsPTAS k-Path connected vertex cover Unit disk graph
Unable to display preview. Download preview PDF.
- 3.Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1978)Google Scholar
- 4.Gollmann, D.: Protocol Analysis for Concrete Environments, EUROCAST 2005. LNCS, vol. 3643, pp. 365–372. Springer, Heidelberg (2005)Google Scholar
- 5.Kratochvil, K.: Intersection graphs of noncrossing arc-connected sets in the plane. In: Proceedings of Symposium on Graph Drawing, GD’96. LNCS, vol. 1190, pp. 257–270 (1997)Google Scholar
- 7.Novotný, M.: Formal Analysis of Security Protocols for Wireless Sensor Networks, accepted to Tatra Mountains Mathematical Publications (2010)Google Scholar
- 8.Novotný, M.: Design and analysis of a generalized canvas protocol. In: Proceedings of WISTP 2010. LNCS 6033, pp. 106–121. Springer (2010)Google Scholar
- 10.Vogt, H.: Integrity preservation for communication in sensor networks. Technical report 434, Institute for Pervasive Computing, ETH Zürich (2004)Google Scholar
- 11.Vogt, H.: Exploring message authentication in sensor networks. In: Castelluccia, C., Hartenstein, H., Paar, C., Westhoff, D. (eds.) ESAS 2004. LNCS, vol. 3313, pp. 19–30. Springer, Heidelberg (2005)Google Scholar
- 12.Vogt, H.: Increasing attack resiliency of wireless ad hoc and sensor netmorks. In: Proceedings of the 2nd International Workshop on Security in Distributed Computing Systems (ICDCSW 2005), vol. 2, pp. 179–184. IEEE Computer Society, Washington (2005)Google Scholar