Document Open Access Logo

Improved Approximations for Flexible Network Design

Authors Dylan Hyatt-Denesik , Afrouz Jabal-Ameli , Laura Sanità

PDF

File

Thumbnail PDF
PDF
LIPIcs.ESA.2024.74.pdf
  • Filesize: 0.75 MB
  • 14 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Approximation algorithms analysis
Keywords
  • Approximation Algorithms
  • Network Design
  • Flexible Connectivity

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Flexible network design deals with building a network that guarantees some connectivity requirements between its vertices, even when some of its elements (like vertices or edges) fail. In particular, the set of edges (resp. vertices) of a given graph are here partitioned into safe and unsafe. The goal is to identify a minimum size subgraph that is 2-edge-connected (resp. 2-vertex-connected), and stay so whenever any of the unsafe elements gets removed. 
In this paper, we provide improved approximation algorithms for flexible network design problems, considering both edge-connectivity and vertex-connectivity, as well as connectivity values higher than 2. For the vertex-connectivity variant, in particular, our algorithm is the first with approximation factor strictly better than 2.

Cite As Get BibTex

Dylan Hyatt-Denesik, Afrouz Jabal-Ameli, and Laura Sanità. Improved Approximations for Flexible Network Design. In 32nd Annual European Symposium on Algorithms (ESA 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 308, pp. 74:1-74:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.ESA.2024.74

Author Details

Dylan Hyatt-Denesik
  • Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands
Afrouz Jabal-Ameli
  • Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands
Laura Sanità
  • Department of Computing Sciences, Bocconi University, Milan, Italy

Funding

The second and the third authors are grateful for the support received from the NWO- VIDI grant VI.Vidi.193.087.

References

  1. David Adjiashvili, Felix Hommelsheim, and Moritz Mühlenthaler. Flexible graph connectivity: Approximating network design problems between 1-and 2-connectivity. Mathematical Programming, 192(1-2):409-441, 2022. Google Scholar
  2. David Adjiashvili, Felix Hommelsheim, Moritz Mühlenthaler, and Oliver Schaudt. Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults. In Artur Czumaj and Qin Xin, editors, 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022), volume 227 of Leibniz International Proceedings in Informatics (LIPIcs), pages 5:1-5:19, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.SWAT.2022.5.
  3. Afrouz Jabal Ameli, Fabrizio Grandoni, and Miguel Calvo-Bosch. A 4/3 approximation for 2-vertex-connectivity. In ICALP, 2023. Google Scholar
  4. Ishan Bansal. A constant factor approximation for the (p, 3)-flexible graph connectivity problem. arXiv preprint arXiv:2308.15714, 2023. Google Scholar
  5. Ishan Bansal, Joseph Cheriyan, Logan Grout, and Sharat Ibrahimpur. Extensions of the (p, q)-flexible-graph-connectivity model. arXiv preprint arXiv:2211.09747, 2022. Google Scholar
  6. Ishan Bansal, Joseph Cheriyan, Logan Grout, and Sharat Ibrahimpur. Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. Google Scholar
  7. Matthias Bentert, Jannik Schestag, and Frank Sommer. On the complexity of finding a sparse connected spanning subgraph in a non-uniform failure model. arXiv preprint arXiv:2308.04575, 2023. Google Scholar
  8. Sylvia Boyd, Joseph Cheriyan, Arash Haddadan, and Sharat Ibrahimpur. Approximation algorithms for flexible graph connectivity. Mathematical Programming, pages 1-24, 2023. Google Scholar
  9. Chandra Chekuri and Rhea Jain. Approximation algorithms for network design in non-uniform fault models. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. Google Scholar
  10. Joseph Cheriyan and Ramakrishna Thurimella. Approximating minimum-size k-connected spanning subgraphs via matching. SIAM Journal on Computing, 30(2):528-560, 2000. Google Scholar
  11. Artur Czumaj and Andrzej Lingas. On approximability of the minimum-cost k-connected spanning subgraph problem. In SODA, volume 99, pages 281-290. Citeseer, 1999. Google Scholar
  12. Harold N Gabow, Michel X Goemans, Éva Tardos, and David P Williamson. Approximating the smallest k-edge connected spanning subgraph by lp-rounding. Networks: An International Journal, 53(4):345-357, 2009. Google Scholar
  13. Mohit Garg, Fabrizio Grandoni, and Afrouz Jabal Ameli. Improved approximation for two-edge-connectivity. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 2368-2410. SIAM, 2023. Google Scholar
  14. Dylan Hyatt-Denesik, Afrouz Jabal Ameli, and Laura Sanita. Improved approximations for flexible network design, 2024. URL: https://arxiv.org/abs/2404.08972.
  15. Kamal Jain. A factor 2 approximation algorithm for the generalized steiner network problem. Combinatorica, 21:39-60, 2001. Google Scholar
  16. Samir Khuller and Balaji Raghavachari. Improved approximation algorithms for uniform connectivity problems. In Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, pages 1-10, 1995. Google Scholar
  17. Samir Khuller and Uzi Vishkin. Biconnectivity approximations and graph carvings. J. ACM, 41(2):214-235, 1994. URL: https://doi.org/10.1145/174652.174654.
  18. Yusuke Kobayashi and Takashi Noguchi. An approximation algorithm for two-edge-connected subgraph problem via triangle-free two-edge-cover. In Satoru Iwata and Naonori Kakimura, editors, 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, volume 283 of LIPIcs, pages 49:1-49:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. URL: https://doi.org/10.4230/LIPICS.ISAAC.2023.49.
  19. Zeev Nutov. Improved approximation algorithms for some capacitated k edge connectivity problems. arXiv preprint arXiv:2307.01650, 2023. Google Scholar
  20. András Sebő and Jens Vygen. Shorter tours by nicer ears: 7/5-approximation for the graph-tsp, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs. Combinatorica, pages 1-34, 2014. Google Scholar
  21. Douglas Brent West et al. Introduction to graph theory, volume 2. Prentice hall Upper Saddle River, 2001. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact