IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v347y2019icp723-733.html
   My bibliography  Save this article

Approximation algorithms for minimum weight connected 3-path vertex cover

Author

Listed:
  • Ran, Yingli
  • Zhang, Zhao
  • Huang, Xiaohui
  • Li, Xiaosong
  • Du, Ding-Zhu

Abstract

A k-path vertex cover (VCPk) is a vertex set C of graph G such that every path of G on k vertices has at least one vertex in C. Because of its background in keeping data integrality of a network, minimum VCPk problem (MinVCPk) has attracted a lot of researches in recent years. This paper studies the minimum weight connected VCPk problem (MinWCVCPk), in which every vertex has a weight and the VCPk found by the algorithm induces a connected subgraph and has the minimum weight. It is known that MinWCVCPk is set-cover-hard. We present two polynomial-time approximation algorithms for MinWCVCP3. The first one is a greedy algorithm achieving approximation ratio 3ln n. The difficulty lies in its analysis dealing with a non-submodular potential function. The second algorithm is a 2-stage one, finding a VCP3 in the first stage and then adding more vertices for connection. We show that its approximation ratio is at most lnδmax+4+ln2, where δmax is the maximum degree of the graph. Considering the inapproximability of this problem, this ratio is asymptotically tight.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:apmaco:v:347:y:2019:i:c:p:723-733
    DOI: 10.1016/j.amc.2018.11.045
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300318310191
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2018.11.045?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.

    References listed on IDEAS

    as
    1. 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.
    2. 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.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    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. 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.
    3. Raka Jovanovic & Antonio P. Sanfilippo & Stefan Voß, 2022. "Fixed set search applied to the multi-objective minimum weighted vertex cover problem," Journal of Heuristics, Springer, vol. 28(4), pages 481-508, August.
    4. Shuli Hu & Xiaoli Wu & Huan Liu & Yiyuan Wang & Ruizhi Li & Minghao Yin, 2019. "Multi-Objective Neighborhood Search Algorithm Based on Decomposition for Multi-Objective Minimum Weighted Vertex Cover Problem," Sustainability, MDPI, vol. 11(13), pages 1-21, July.
    5. 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.

    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:eee:apmaco:v:347:y:2019:i:c:p:723-733. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.