Skip to main content
SpringerLink
Log in

PTAS for Minimum k-Path Connected Vertex Cover in Growth-Bounded Graphs

  • Conference paper
Book cover Algorithms and Architectures for Parallel Processing (ICA3PP 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8630))

  • 2577 Accesses

Abstract

In the paper, we present a polynomial-time approximation scheme (PTAS) for the minimum k-path connected vertex cover (MkPCVC) problem , which can be used to solve security problems in wireless sensor networks (WSNs), under fixed k≥ 2. In contrast to previously known approximation schemes for MkPCVC problem, our approach does not need location data of the vertices, and it can be applied to growth-bounded graphs. For any ε 1 >0, the algorithm returns a (1+ε 1)-approximation MkPCVC. We have proved the correctness and performance of the algorithm and shown its runtime is r∙n O(f(r)), where f(r) is a polynomial function, r = O((1/ε)∙ln(1/ε)) and ε is only dependent on k and ε 1.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brešar, B., Kardoš, F., Katrenič, J., Semanišin, G.: Minimum k-path vertex cover. Dis. Appl. Math. 159, 1189–1195 (2011)

    Article  MATH  Google Scholar 

  2. Liu, X., Lu, H., Wang, W., Wu, W.: PTAS for the minimum k-path connected vertex cover problem in unit disk graphs. J. Global Opt. 56, 449–458 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  3. Gollmann, D.: Protocol analysis for concrete environments. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds.) EUROCAST 2005. LNCS, vol. 3643, pp. 365–372. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Menezes, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press (2010)

    Google Scholar 

  5. Novotný, M.: Formal analysis of security protocols for wireless sensor networks. Tatra Mt. Math. Publ. 47, 81–97 (2010)

    MATH  MathSciNet  Google Scholar 

  6. Novotný, M.: Design and analysis of a generalized canvas protocol. In: Samarati, P., Tunstall, M., Posegga, J., Markantonakis, K., Sauveron, D. (eds.) WISTP 2010. LNCS, vol. 6033, pp. 106–121. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Vogt, H.: Integrity preservation for communication in sensor networks. Tech. Rep. 434, ETH Zurich, Institute for Pervasive Computing (2004)

    Google Scholar 

  8. Vogt, H.: Exploring message authentication in sensor networks. In: 1st European Workshop Security Ad-Hoc Sensor Networks (2004)

    Google Scholar 

  9. Vogt, H.: Increasing Attack Resiliency of Wireless Ad Hoc and Sensor Networks. In: 2nd International Workshop on Security in Distributed Computing Systems, pp. 179-184 (2005)

    Google Scholar 

  10. Tu, J., Zhou, W.: A factor 2 approximation algorithm for the vertex cover P3 problem. Info Proc. Lett. 111, 683–686 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Local approximation schemes for ad hoc and sensor networks. In: DIALM-POMC Cologne, Germany, pp. 97-103 (2005)

    Google Scholar 

  12. Nieberg, T., Hurink, J.: A PTAS for the minimum dominating set problem in unit disk graphs. In: Approximation and Online Algorithms, pp. 296-306 (2006)

    Google Scholar 

  13. Gfeller, B., Vicari, E.: A Faster Distributed Approximation Scheme for the connected Dominating Set Problem for Growth-Bounded Graphs. In: 6th International Conference on Ad-Hoc, Mobile, and Wireless Networks, pp. 59-73 (2007)

    Google Scholar 

  14. Gao, X., Wang, W., Zhang, Z., Zhu, S., Wu, W.: A PTAS for minimum d-hop connected dominating set in growth-bounded graphs. Opt Lett 4, 321–333 (2010)

    MATH  MathSciNet  Google Scholar 

  15. Liu, Y., Fan, J., Wang, D., Du, H., Zhang, S., Lv, J.: Approximation Algorithms for Vertex Cover Problems in WSN Topology Design. Ad Hoc and Sensor Wireless Networks (accepted)

    Google Scholar 

  16. Wang, Z., Wang, W., Kim, J.M., Thuraisingham, B., Wu, W.: PTAS for the minimum weighted dominating set in growth bounded graphs. J. Global Opt. 54, 641–648 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  17. Nieberg, T., Hurink, J.L., Kern, W.: A robust ptas for maximum weight independent sets in unit disk graphs. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 214–221. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Soochow University, 215006, Suzhou, China

    Yan Chu, Jianxi Fan, Wenjun Liu & Cheng-Kuan Lin

Authors
  1. Yan Chu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianxi Fan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wenjun Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Cheng-Kuan Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Illinois Institute of Technology, 60616-3793, Chicago, IL, USA

    Xian-he Sun

  2. School of Computer Science and Technology, Dalian Maritime University, 1 Linghai Road, 116026, Dalian, China

    Wenyu Qu

  3. University of Ottawa, SEECS, 8, King Edward Ave, K1N 6N5, Ottawa, ON, Canada

    Ivan Stojmenovic

  4. Deakin University, 221 Burwood Highway, 3125, Burwood, VIC, Australia

    Wanlei Zhou

  5. Dalian Maritime University, NO.1 Linhai Road, 116026, Dailian, China

    Zhiyang Li  & Tingting Yang  & 

  6. BeiHang University, XueYuan Road No.37,HaiDian District, Beijing, China

    Hua Guo

  7. University of Bradford, BD7 1DP, Bradford, West Yorkshire, United Kingdom

    Geyong Min

  8. Computer Network Information Center, Chinese Academy of Sciences, 100190, Beijing, China

    Yulei Wu

  9. 27 Shanda Nanlu, 250100, Jinan City, Shandong Province, China

    Lei Liu

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Chu, Y., Fan, J., Liu, W., Lin, CK. (2014). PTAS for Minimum k-Path Connected Vertex Cover in Growth-Bounded Graphs. In: Sun, Xh., et al. Algorithms and Architectures for Parallel Processing. ICA3PP 2014. Lecture Notes in Computer Science, vol 8630. Springer, Cham. https://doi.org/10.1007/978-3-319-11197-1_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11197-1_9

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11196-4

  • Online ISBN: 978-3-319-11197-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation