IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/519.html
   My bibliography  Save this paper

An analysis of the greedy algorithm for the submodular set covering problem

Author

Listed:
  • WOLSEY, L.A.

Abstract

No abstract is available for this item.

Suggested Citation

  • Wolsey, L.A., 1982. "An analysis of the greedy algorithm for the submodular set covering problem," LIDAM Reprints CORE 519, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvrp:519
    DOI: 10.1007/BF02579435
    Note: In : Combinatorica, 2(4), 385-393, 1982
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. 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.
    2. Majun Shi & Zishen Yang & Wei Wang, 2023. "Greedy guarantees for minimum submodular cost submodular/non-submodular cover problem," Journal of Combinatorial Optimization, Springer, vol. 45(1), pages 1-16, January.
    3. Shi, Majun & Yang, Zishen & Wang, Wei, 2021. "Minimum non-submodular cover problem with applications," Applied Mathematics and Computation, Elsevier, vol. 410(C).
    4. Alfredo Torrico & Mohit Singh & Sebastian Pokutta & Nika Haghtalab & Joseph (Seffi) Naor & Nima Anari, 2021. "Structured Robust Submodular Maximization: Offline and Online Algorithms," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1590-1607, October.
    5. Dongyue Liang & Zhao Zhang & Xianliang Liu & Wei Wang & Yaolin Jiang, 2016. "Approximation algorithms for minimum weight partial connected set cover problem," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 696-712, February.
    6. G. Calinescu & A. Zelikovsky, 2005. "The Polymatroid Steiner Problems," Journal of Combinatorial Optimization, Springer, vol. 9(3), pages 281-294, May.
    7. Dana Angluin & James Aspnes & Lev Reyzin, 2015. "Network construction with subgraph connectivity constraints," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 418-432, February.
    8. Liao, Hao & Wu, Xingtong & Wang, Bing-Hong & Wu, Xiangyang & Zhou, Mingyang, 2019. "Solving the speed and accuracy of box-covering problem in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 954-963.
    9. Fatemeh Navidi & Prabhanjan Kambadur & Viswanath Nagarajan, 2020. "Adaptive Submodular Ranking and Routing," Operations Research, INFORMS, vol. 68(3), pages 856-877, May.
    10. Chandra Chekuri & Tanmay Inamdar & Kent Quanrud & Kasturi Varadarajan & Zhao Zhang, 2022. "Algorithms for covering multiple submodular constraints and applications," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 979-1010, September.
    11. Ran, Yingli & Zhang, Ying & Zhang, Zhao, 2021. "Parallel approximation for partial set cover," Applied Mathematics and Computation, Elsevier, vol. 408(C).
    12. Xu Zhu & Jieun Yu & Wonjun Lee & Donghyun Kim & Shan Shan & Ding-Zhu Du, 2010. "New dominating sets in social networks," Journal of Global Optimization, Springer, vol. 48(4), pages 633-642, December.

    More about this item

    Statistics

    Access and download statistics

    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:cor:louvrp:519. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.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.