IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v41y2024i06ns0217595924500052.html
   My bibliography  Save this article

Efficient Parallel Algorithm for Minimum Cost Submodular Cover Problem with Lower Adaptive Complexity

Author

Listed:
  • Hue T. Nguyen

    (Graduate University of Science and Technology, Vietnam Academy of Science and Technology (VAST), Hanoi, Vietnam2Faculty of Information Technology, Hanoi Architecture University, Hanoi, Vietnam)

  • Dung T. K. Ha

    (Faculty of Information Technology, University of Engineering and Technology, Vietnam National University, Hanoi, 144 Xuan Thuy Street, Cau Giay District, Hanoi 10000, Vietnam)

  • Canh V. Pham

    (ORLab, Faculty of Computer Science, Phenikaa University, Yen Nghia Ward, Ha Dong District, Hanoi 12116, Vietnam)

Abstract

In this paper, we study the Minimum Cost Submodular Cover (ℳ𠒞𠒮𠒞) problem over the ground set of size n, which aims at finding a subset with the minimal cost required so that the utility submodular function exceeds a given threshold. The problem has recently attracted a lot of attention due to its applications in various domains of operations research and artificial intelligence. However, the existing algorithms for this problem may not be easy to parallelize because of their costly adaptive complexity. However, the existing algorithms for this problem may not be effectively parallelized because of their costly adaptive complexity. This paper proposes an efficient parallel algorithm that returns a (1 − λ, (1 + 𠜖)(1 +log 1 λ))-bicriteria approximation solution within O(log n) adaptive complexity, where λ,𠜖 are fixed parameters. Our algorithm requires O(n2log2n) query complexity, however, it can reduce to O(nlog3n) instead while retaining a low adaptive complexity of O(log2n). Therefore, our algorithm not only achieves the same approximation guarantees as the state of the art but also significantly improves the best-known low adaptive complexity algorithm for the above problem.

Suggested Citation

  • Hue T. Nguyen & Dung T. K. Ha & Canh V. Pham, 2024. "Efficient Parallel Algorithm for Minimum Cost Submodular Cover Problem with Lower Adaptive Complexity," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 41(06), pages 1-21, December.
    • Handle: RePEc:wsi:apjorx:v:41:y:2024:i:06:n:s0217595924500052
    DOI: 10.1142/S0217595924500052
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595924500052
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595924500052?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.

    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:wsi:apjorx:v:41:y:2024:i:06:n:s0217595924500052. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.