Document Open Access Logo

On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model

Authors Matthias Bentert, Jannik Schestag , Frank Sommer

PDF
Thumbnail PDF

File

LIPIcs.IPEC.2023.4.pdf
  • Filesize: 0.7 MB
  • 12 pages

Document Identifiers

Author Details

Matthias Bentert
  • Department of Informatics, University of Bergen, Norway
Jannik Schestag
  • Faculteit Elektrotechniek, Wiskunde en Informatica, TU Delft, The Netherlands
  • Fakultät für Mathematik und Informatik, Friedrich-Schiller-Universität Jena, Germany
Frank Sommer
  • Fakultät für Mathematik und Informatik, Friedrich-Schiller-Universität Jena, Germany

Funding

  • Bentert, Matthias: Supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 819416).
  • Schestag, Jannik: Supported by the German Academic Exchange Service (DAAD), project 57556279.
  • Sommer, Frank: Supported by the Deutsche Forschungsgemeinschaft (DFG), project EAGR, {KO 3669/{6-1}}.

Acknowledgements

This work was initiated at the research retreat of the Algorithmics and Computational Complexity group of TU Berlin held in Darlingerode in September 2022.

Cite AsGet BibTex

Matthias Bentert, Jannik Schestag, and Frank Sommer. On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 285, pp. 4:1-4:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/LIPIcs.IPEC.2023.4

Abstract

We study a generalization of the classic Spanning Tree problem that allows for a non-uniform failure model. More precisely, edges are either safe or unsafe and we assume that failures only affect unsafe edges. In Unweighted Flexible Graph Connectivity we are given an undirected graph G = (V,E) in which the edge set E is partitioned into a set S of safe edges and a set U of unsafe edges and the task is to find a set T of at most k edges such that T - {u} is connected and spans V for any unsafe edge u ∈ T. Unweighted Flexible Graph Connectivity generalizes both Spanning Tree and Hamiltonian Cycle. We study Unweighted Flexible Graph Connectivity in terms of fixed-parameter tractability (FPT). We show an almost complete dichotomy on which parameters lead to fixed-parameter tractability and which lead to hardness. To this end, we obtain FPT-time algorithms with respect to the vertex deletion distance to cluster graphs and with respect to the treewidth. By exploiting the close relationship to Hamiltonian Cycle, we show that FPT-time algorithms for many smaller parameters are unlikely under standard parameterized complexity assumptions. Regarding problem-specific parameters, we observe that Unweighted Flexible Graph Connectivity admits an FPT-time algorithm when parameterized by the number of unsafe edges. Furthermore, we investigate a below-upper-bound parameter for the number of edges of a solution. We show that this parameter also leads to an FPT-time algorithm.

Subject Classification

ACM Subject Classification
  • Theory of computation → Parameterized complexity and exact algorithms
  • Theory of computation → Graph algorithms analysis
Keywords
  • Flexible graph connectivity
  • NP-hard problem
  • parameterized complexity
  • below-guarantee parameterization
  • treewidth

Metrics

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

Related Versions

References

  1. David Adjiashvili, Felix Hommelsheim, and Moritz Mühlenthaler. Flexible graph connectivity. Mathematical Programming, 192(1):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 Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT '22), volume 227 of LIPIcs, pages 5:1-5:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. Google Scholar
  3. Takanori Akiyama, Takao Nishizeki, and Nobuji Saito. NP-completeness of the hamiltonian cycle problem for bipartite graphs. Journal of Information processing, 3(2):73-76, 1980. Google Scholar
  4. Jørgen Bang-Jensen, Manu Basavaraju, Kristine Vitting Klinkby, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, and Meirav Zehavi. Parameterized algorithms for survivable network design with uniform demands. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '18), pages 2838-2850. SIAM, 2018. Google Scholar
  5. Jørgen Bang-Jensen and Anders Yeo. The minimum spanning strong subdigraph problem is fixed parameter tractable. Discrete Applied Mathematics, 156(15):2924-2929, 2008. 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 Proceedings of the 50th International Colloquium on Automata, Languages, and Programming (ICALP '23), volume 261 of LIPIcs, pages 15:1-15:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. Google Scholar
  7. Hans L. Bodlaender, Bart M. P. Jansen, and Stefan Kratsch. Kernel bounds for path and cycle problems. Theoretical Computer Science, 511:117-136, 2013. Google Scholar
  8. Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, and Sharat Ibrahimpur. Approximation algorithms for flexible graph connectivity. In Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS '21), pages 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. Google Scholar
  9. Chandra Chekuri and Rhea Jain. Approximation algorithms for network design in non-uniform fault models. In Proceedings of the 50th International Colloquium on Automata, Languages, and Programming (ICALP '23), volume 261 of LIPIcs, pages 36:1-36:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. Google Scholar
  10. Ali Çivril. A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem. Theoretical Computer Science, 943:121-130, 2023. Google Scholar
  11. Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015. Google Scholar
  12. Rodney G. Downey and Michael R. Fellows. Fundamentals of Parameterized Complexity. Springer, 2013. Google Scholar
  13. Andreas Emil Feldmann, Anish Mukherjee, and Erik Jan van Leeuwen. The parameterized complexity of the survivable network design problem. In Proceedings of the 5th Symposium on Simplicity in Algorithms (SOSA '22), pages 37-56. SIAM, 2022. Google Scholar
  14. Corinne Feremans, Martine Labbé, and Gilbert Laporte. Generalized network design problems. European Journal of Operational Research, 148(1):1-13, 2003. Google Scholar
  15. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, and Saket Saurabh. Intractability of clique-width parameterizations. SIAM Journal on Computing, 39(5):1941-1956, 2010. Google Scholar
  16. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi. Clique-width III: hamiltonian cycle and the odd case of graph coloring. ACM Transactions on Algorithms, 15(1):9:1-9:27, 2019. Google Scholar
  17. Harold N. Gabow and Suzanne Gallagher. Iterated rounding algorithms for the smallest k-edge connected spanning subgraph. SIAM Journal on Computing, 41(1):61-103, 2012. Google Scholar
  18. M. R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979. Google Scholar
  19. Martin Charles Golumbic. Algorithmic graph theory and perfect graphs. Academic Press, 1980. Google Scholar
  20. Woonghee Tim Huh. Finding 2-edge connected spanning subgraphs. Operations Research Letters, 32(3):212-216, 2004. Google Scholar
  21. Christoph Hunkenschröder, Santosh S. Vempala, and Adrian Vetta. A 4/3-approximation algorithm for the minimum 2-edge connected subgraph problem. ACM Transactions on Algorithms, 15(4):55:1-55:28, 2019. Google Scholar
  22. Joseph B Kruskal. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical society, 7(1):48-50, 1956. Google Scholar
  23. Meena Mahajan and Venkatesh Raman. Parameterizing above guaranteed values: Maxsat and maxcut. Journal of Algorithms, 31(2):335-354, 1999. Google Scholar
  24. Meena Mahajan, Venkatesh Raman, and Somnath Sikdar. Parameterizing above or below guaranteed values. Journal of Computer and System Sciences, 75(2):137-153, 2009. Google Scholar
  25. Robert Clay Prim. Shortest connection networks and some generalizations. The Bell System Technical Journal, 36(6):1389-1401, 1957. Google Scholar
  26. 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, 34(5):597-629, 2014. Google Scholar
  27. Lawrence V Snyder, Maria P Scaparra, Mark S Daskin, and Richard L Church. Planning for disruptions in supply chain networks. In Models, methods, and applications for innovative decision making, pages 234-257. Informs, 2006. Google Scholar
  28. Douglas B. West. Introduction to Graph Theory. Prentice Hall, 2000. Google Scholar
  29. Ying Xu, Victor Olman, and Dong Xu. Clustering gene expression data using a graph-theoretic approach: an application of minimum spanning trees. Bioinformatics, 18(4):536-545, 2002. 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-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact