IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v56y2013i2p449-458.html
   My bibliography  Save this article

PTAS for the minimum k-path connected vertex cover problem in unit disk graphs

Author

Listed:
  • Xianliang Liu
  • Hongliang Lu
  • Wei Wang
  • Weili Wu

Abstract

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. Copyright Springer Science+Business Media, LLC. 2013

Suggested Citation

  • Xianliang Liu & Hongliang Lu & Wei Wang & Weili Wu, 2013. "PTAS for the minimum k-path connected vertex cover problem in unit disk graphs," Journal of Global Optimization, Springer, vol. 56(2), pages 449-458, June.
    • Handle: RePEc:spr:jglopt:v:56:y:2013:i:2:p:449-458
    DOI: 10.1007/s10898-011-9831-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-011-9831-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-011-9831-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lina Chen & Xiaohui Huang & Zhao Zhang, 2018. "A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 35-43, July.
    2. Ran, Yingli & Zhang, Zhao & Huang, Xiaohui & Li, Xiaosong & Du, Ding-Zhu, 2019. "Approximation algorithms for minimum weight connected 3-path vertex cover," Applied Mathematics and Computation, Elsevier, vol. 347(C), pages 723-733.
    3. Limin Wang & Wenxue Du & Zhao Zhang & Xiaoyan Zhang, 2017. "A PTAS for minimum weighted connected vertex cover $$P_3$$ P 3 problem in 3-dimensional wireless sensor networks," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 106-122, January.
    4. Ou Sun & Neng Fan, 2019. "Solving the multistage PMU placement problem by integer programming and equivalent network design model," Journal of Global Optimization, Springer, vol. 74(3), pages 477-493, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:56:y:2013:i:2:p:449-458. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.