IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v33y2021i2p774-784.html
   My bibliography  Save this article

Breaking the r max Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem

Author

Listed:
  • Yingli Ran

    (College of Mathematics and Computer Sciences, Zhejiang Normal University, Jinhua, Zhejiang 321004, China)

  • Zhao Zhang

    (College of Mathematics and Computer Sciences, Zhejiang Normal University, Jinhua, Zhejiang 321004, China)

  • Shaojie Tang

    (Naveen Jindal School of Management, University of Texas at Dallas, Richardson, Texas 75080)

  • Ding-Zhu Du

    (Department of Computer Science, University of Texas at Dallas, Richardson, Texas 75080)

Abstract

Given an element set E of order n , a collection of subsets S ⊆ 2 E , a cost c S on each set S ∈ S , a covering requirement r e for each element e ∈ E , and an integer k , the goal of a minimum partial set multicover problem (MinPSMC) is to find a subcollection F ⊆ S to fully cover at least k elements such that the cost of F is as small as possible and element e is fully covered by F if it belongs to at least r e sets of F . This problem generalizes the minimum k -union problem (Min k U) and is believed not to admit a subpolynomial approximation ratio. In this paper, we present a ( 4 log ⁡ n H ( Δ ) In k + 2 ⁡ log n n ) -approximation algorithm for MinPSMC, in which Δ is the maximum size of a set in S . And when k = Ω ( n ) , we present a bicriteria algorithm fully covering at least ( 1 − ε 2 log n ) k elements with approximation ratio O ( 1 ε ( log n ) 2 H ( Δ ) ) , where 0 < ε < 1 is a fixed number. These results are obtained by studying the minimum density subcollection problem with (or without) cardinality constraint, which might be of interest by itself.

Suggested Citation

  • Yingli Ran & Zhao Zhang & Shaojie Tang & Ding-Zhu Du, 2021. "Breaking the r max Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 774-784, May.
    • Handle: RePEc:inm:orijoc:v:33:y:2021:i:2:p:774-784
    DOI: 10.1287/ijoc.2020.0975
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2020.0975
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2020.0975?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
    ---><---

    References listed on IDEAS

    as
    1. Yishuo Shi & Yingli Ran & Zhao Zhang & James Willson & Guangmo Tong & Ding-Zhu Du, 2019. "Approximation algorithm for the partial set multi-cover problem," Journal of Global Optimization, Springer, vol. 75(4), pages 1133-1146, December.
    2. Yingli Ran & Yishuo Shi & Changbing Tang & Zhao Zhang, 2020. "A primal-dual algorithm for the minimum partial set multi-cover problem," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 725-746, April.
    3. Thang N. Dinh & Yilin Shen & Dung T. Nguyen & My T. Thai, 2014. "On the approximability of positive influence dominating set in social networks," Journal of Combinatorial Optimization, Springer, vol. 27(3), pages 487-503, April.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Zhao Zhang & Wei Liang & Hongmin W. Du & Siwen Liu, 2022. "Constant Approximation for the Lifetime Scheduling Problem of p -Percent Coverage," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2675-2685, September.

    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. Yingli Ran & Xiaohui Huang & Zhao Zhang & Ding-Zhu Du, 2021. "Approximation algorithm for minimum power partial multi-coverage in wireless sensor networks," Journal of Global Optimization, Springer, vol. 80(3), pages 661-677, July.
    2. Man Xiao & Weidong Li & Xiaofei Liu, 2023. "Online Mixed Ring Covering Problem with Two Nodes," SN Operations Research Forum, Springer, vol. 4(1), pages 1-20, March.
    3. Weidong Chen & Hao Zhong & Lidong Wu & Ding-Zhu Du, 2022. "A general greedy approximation algorithm for finding minimum positive influence dominating sets in social networks," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 1-20, August.
    4. Lihe Guan & Hong Wang, 2022. "A heuristic approximation algorithm of minimum dominating set based on rough set theory," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 752-769, August.
    5. S. Raghavan & Rui Zhang, 2022. "Rapid Influence Maximization on Social Networks: The Positive Influence Dominating Set Problem," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1345-1365, May.
    6. Yingli Ran & Zhao Zhang & Hongwei Du & Yuqing Zhu, 2017. "Approximation algorithm for partial positive influence problem in social network," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 791-802, February.
    7. S. Raghavan & Rui Zhang, 2022. "Influence Maximization with Latency Requirements on Social Networks," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 710-728, March.
    8. Yingli Ran & Yishuo Shi & Changbing Tang & Zhao Zhang, 2020. "A primal-dual algorithm for the minimum partial set multi-cover problem," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 725-746, April.
    9. Yingli Ran & Yishuo Shi & Zhao Zhang, 2017. "Local ratio method on partial set multi-cover," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 302-313, July.
    10. Zhao Zhang & Wei Liang & Hongmin W. Du & Siwen Liu, 2022. "Constant Approximation for the Lifetime Scheduling Problem of p -Percent Coverage," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2675-2685, September.

    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:inm:orijoc:v:33:y:2021:i:2:p:774-784. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.