IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v29y2015i2d10.1007_s10878-013-9603-2.html
   My bibliography  Save this article

Network construction with subgraph connectivity constraints

Author

Listed:
  • Dana Angluin

    (Yale University)

  • James Aspnes

    (Yale University)

  • Lev Reyzin

    (University of Illinois at Chicago)

Abstract

We consider the problem introduced by Korach and Stern (Mathematical Programming, 98:345–414, 2003) of building a network given connectivity constraints. A network designer is given a set of vertices $$V$$ and constraints $$S_i \subseteq V$$ , and seeks to build the lowest cost set of edges $$E$$ such that each $$S_i$$ induces a connected subgraph of $$(V,E)$$ . First, we answer a question posed by Korach and Stern (Discrete Applied Mathematics, 156:444–450, 2008): for the offline version of the problem, we prove an $$\varOmega (\log n)$$ hardness of approximation result for uniform cost networks (where edge costs are all $$1$$ ) and give an algorithm that almost matches this bound, even in the arbitrary cost case. Then we consider the online problem, where the constraints must be satisfied as they arrive. We give an $$O(n\log n)$$ -competitive algorithm for the arbitrary cost online problem, which has an $$\varOmega (n)$$ -competitive lower bound. We look at the uniform cost case as well and give an $$O(n^{2/3}\log ^{2/3} n)$$ -competitive algorithm against an oblivious adversary, as well as an $$\varOmega (\sqrt{n})$$ -competitive lower bound against an adaptive adversary. We also examine cases when the underlying network graph is known to be a star or a path and prove matching upper and lower bounds of $$\Theta (\log n)$$ on the competitive ratio for them.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:jcomop:v:29:y:2015:i:2:d:10.1007_s10878-013-9603-2
    DOI: 10.1007/s10878-013-9603-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-013-9603-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-013-9603-2?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. 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).
    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. 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. Ran, Yingli & Zhang, Ying & Zhang, Zhao, 2021. "Parallel approximation for partial set cover," Applied Mathematics and Computation, Elsevier, vol. 408(C).
    3. 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.
    4. Shi, Majun & Yang, Zishen & Wang, Wei, 2021. "Minimum non-submodular cover problem with applications," Applied Mathematics and Computation, Elsevier, vol. 410(C).
    5. G. Calinescu & A. Zelikovsky, 2005. "The Polymatroid Steiner Problems," Journal of Combinatorial Optimization, Springer, vol. 9(3), pages 281-294, May.
    6. 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.
    7. Fatemeh Navidi & Prabhanjan Kambadur & Viswanath Nagarajan, 2020. "Adaptive Submodular Ranking and Routing," Operations Research, INFORMS, vol. 68(3), pages 856-877, May.
    8. 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.
    9. 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.
    10. 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.
    11. Hao Zhong, 2024. "On greedy approximation algorithm for the minimum resolving dominating set problem," Journal of Combinatorial Optimization, Springer, vol. 48(4), pages 1-8, November.
    12. 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.

    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:jcomop:v:29:y:2015:i:2:d:10.1007_s10878-013-9603-2. 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: 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.