Survivable Network Design for Group Connectivity in Low-Treewidth Graphs

Authors Parinya Chalermsook, Syamantak Das , Guy Even, Bundit Laekhanukit , Daniel Vaz

Thumbnail PDF


  • Filesize: 0.53 MB
  • 19 pages

Document Identifiers

Author Details

Parinya Chalermsook
  • Department of Computer Science, Aalto University, Espoo, Finland
Syamantak Das
  • Indraprastha Institute of Information Technology Delhi, Delhi, India
Guy Even
  • Tel-Aviv University, Tel-Aviv, Israel
Bundit Laekhanukit
  • Max-Planck-Institut für Informatik, Saarücken, Germany and, Institute for Theoretical Computer Science, Shanghai University of Finance and Economics, Shanghai, China
Daniel Vaz
  • Max-Planck-Institut für Informatik, Germany & Graduate School of Computer Science, Saarland University, Saarücken, Germany

Cite AsGet BibTex

Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, and Daniel Vaz. Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 116, pp. 8:1-8:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


In the Group Steiner Tree problem (GST), we are given a (edge or vertex)-weighted graph G=(V,E) on n vertices, together with a root vertex r and a collection of groups {S_i}_{i in [h]}: S_i subseteq V(G). The goal is to find a minimum-cost subgraph H that connects the root to every group. We consider a fault-tolerant variant of GST, which we call Restricted (Rooted) Group SNDP. In this setting, each group S_i has a demand k_i in [k], k in N, and we wish to find a minimum-cost subgraph H subseteq G such that, for each group S_i, there is a vertex in the group that is connected to the root via k_i (vertex or edge) disjoint paths. While GST admits O(log^2 n log h) approximation, its higher connectivity variants are known to be Label-Cover hard, and for the vertex-weighted version, the hardness holds even when k=2 (it is widely believed that there is no subpolynomial approximation for the Label-Cover problem [Bellare et al., STOC 1993]). More precisely, the problem admits no 2^{log^{1-epsilon}n}-approximation unless NP subseteq DTIME(n^{polylog(n)}). Previously, positive results were known only for the edge-weighted version when k=2 [Gupta et al., SODA 2010; Khandekar et al., Theor. Comput. Sci., 2012] and for a relaxed variant where k_i disjoint paths from r may end at different vertices in a group [Chalermsook et al., SODA 2015], for which the authors gave a bicriteria approximation. For k >= 3, there is no non-trivial approximation algorithm known for edge-weighted Restricted Group SNDP, except for the special case of the relaxed variant on trees (folklore). Our main result is an O(log n log h) approximation algorithm for Restricted Group SNDP that runs in time n^{f(k, w)}, where w is the treewidth of the input graph. Our algorithm works for both edge and vertex weighted variants, and the approximation ratio nearly matches the lower bound when k and w are constants. The key to achieving this result is a non-trivial extension of a framework introduced in [Chalermsook et al., SODA 2017]. This framework first embeds all feasible solutions to the problem into a dynamic program (DP) table. However, finding the optimal solution in the DP table remains intractable. We formulate a linear program relaxation for the DP and obtain an approximate solution via randomized rounding. This framework also allows us to systematically construct DP tables for high-connectivity problems. As a result, we present new exact algorithms for several variants of survivable network design problems in low-treewidth graphs.

Subject Classification

ACM Subject Classification
  • Theory of computation → Routing and network design problems
  • Approximation Algorithms
  • Hardness of Approximation
  • Survivable Network Design
  • Group Steiner Tree


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


  1. MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, and Dániel Marx. Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. J. ACM, 58(5):21:1-21:37, 2011. URL:
  2. Mihir Bellare, Shafi Goldwasser, Carsten Lund, and A. Russeli. Efficient probabilistically checkable proofs and applications to approximations. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA, pages 294-304, 1993. URL:
  3. André Berger and Michelangelo Grigni. Minimum weight 2-edge-connected spanning subgraphs in planar graphs. In Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pages 90-101, 2007. Google Scholar
  4. Hans L. Bodlaender. NC-algorithms for graphs with small treewidth. In Jan van Leeuwen, editor, Graph-Theoretic Concepts in Computer Science, 14th International Workshop, WG '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings, volume 344 of Lecture Notes in Computer Science, pages 1-10. Springer, 1988. URL:
  5. Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, and Michal Pilipczuk. A c^k n 5-approximation algorithm for treewidth. SIAM J. Comput., 45(2):317-378, 2016. Google Scholar
  6. Richard B. Borie, R. Gary Parker, and Craig A. Tovey. Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families. Algorithmica, 7(5&6):555-581, 1992. URL:
  7. Glencora Borradaile, Erik D. Demaine, and Siamak Tazari. Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs. Algorithmica, 68(2):287-311, 2014. Google Scholar
  8. Glencora Borradaile, Philip N. Klein, and Claire Mathieu. An O(n log n) approximation scheme for steiner tree in planar graphs. ACM Trans. Algorithms, 5(3):31:1-31:31, 2009. URL:
  9. Glencora Borradaile, Philip N. Klein, and Claire Mathieu. A polynomial-time approximation scheme for euclidean steiner forest. ACM Trans. Algorithms, 11(3):19:1-19:20, 2015. Google Scholar
  10. Glencora Borradaile and Baigong Zheng. A PTAS for three-edge-connected survivable network design in planar graphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2017, August 16-18, 2017, Berkeley, CA, USA, pages 3:1-3:13, 2017. Google Scholar
  11. İSMET Esra Büyüktahtakin. Dynamic Programming Via Linear Programming. John Wiley &Sons, Inc., 2010. Google Scholar
  12. Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, and Daniel Vaz. Beyond metric embedding: Approximating group steiner trees on bounded treewidth graphs. In Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pages 737-751, 2017. Google Scholar
  13. Parinya Chalermsook, Fabrizio Grandoni, and Bundit Laekhanukit. On survivable set connectivity. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015, San Diego, CA, USA, January 4-6, 2015, pages 25-36, 2015. Google Scholar
  14. Joseph Cheriyan and Adrian Vetta. Approximation algorithms for network design with metric costs. SIAM J. Discrete Math., 21(3):612-636, 2007. URL:
  15. Julia Chuzhoy and Sanjeev Khanna. Algorithms for single-source vertex connectivity. In 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pages 105-114, 2008. Google Scholar
  16. Julia Chuzhoy and Sanjeev Khanna. An o(k^3log n)-approximation algorithm for vertex-connectivity survivable network design. Theory of Computing, 8(1):401-413, 2012. URL:
  17. Bruno Courcelle. The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Inf. Comput., 85(1):12-75, 1990. URL:
  18. Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, and Jakub Onufry Wojtaszczyk. Solving connectivity problems parameterized by treewidth in single exponential time. In IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011, pages 150-159, 2011. Google Scholar
  19. Artur Czumaj, Michelangelo Grigni, Papa Sissokho, and Hairong Zhao. Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004, pages 496-505, 2004. Google Scholar
  20. Daniela Pucci de Farias and Benjamin Van Roy. Approximate dynamic programming via linear programming. In Advances in Neural Information Processing Systems 14 [Neural Information Processing Systems: Natural and Synthetic, NIPS 2001, December 3-8, 2001, Vancouver, British Columbia, Canada], pages 689-695, 2001. URL:
  21. F d'Epenoux. A probabilistic production and inventory problem. Management Science, 10(1):98-108, 1963. Google Scholar
  22. Naveen Garg, Goran Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group steiner tree problem. J. Algorithms, 37(1):66-84, 2000. Google Scholar
  23. Anupam Gupta, Ravishankar Krishnaswamy, and R. Ravi. Tree embeddings for two-edge-connected network design. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17-19, 2010, pages 1521-1538, 2010. URL:
  24. Anupam Gupta, Kunal Talwar, and David Witmer. Sparsest cut on bounded treewidth graphs: algorithms and hardness results. In Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013, pages 281-290, 2013. URL:
  25. Eran Halperin and Robert Krauthgamer. Polylogarithmic inapproximability. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pages 585-594, 2003. Google Scholar
  26. Kamal Jain. A factor 2 approximation algorithm for the generalized steiner network problem. Combinatorica, 21(1):39-60, 2001. Google Scholar
  27. Rohit Khandekar, Guy Kortsarz, and Zeev Nutov. Approximating fault-tolerant group-steiner problems. Theor. Comput. Sci., 416:55-64, 2012. URL:
  28. Bundit Laekhanukit. An improved approximation algorithm for the minimum cost subset k-connected subgraph problem. Algorithmica, 72(3):714-733, 2015. Google Scholar
  29. Alan S Manne. Linear programming and sequential decisions. Management Science, 6(3):259-267, 1960. Google Scholar
  30. R. Kipp Martin, Ronald L. Rardin, and Brian A. Campbell. Polyhedral characterization of discrete dynamic programming. Operations Research, 38(1):127-138, 1990. URL:
  31. Zeev Nutov. Approximating minimum-cost connectivity problems via uncrossable bifamilies. ACM Trans. Algorithms, 9(1):1:1-1:16, 2012. Google Scholar
  32. Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, and Erik Jan van Leeuwen. Subexponential-time parameterized algorithm for steiner tree on planar graphs. In 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pages 353-364, 2013. Google Scholar
  33. David P. Williamson, Michel X. Goemans, Milena Mihail, and Vijay V. Vazirani. A primal-dual approximation algorithm for generalized steiner network problems. Combinatorica, 15(3):435-454, 1995. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail