Document

# On Approximating Degree-Bounded Network Design Problems

## File

LIPIcs.APPROX-RANDOM.2020.39.pdf
• Filesize: 0.61 MB
• 21 pages

## Cite As

Xiangyu Guo, Guy Kortsarz, Bundit Laekhanukit, Shi Li, Daniel Vaz, and Jiayi Xian. On Approximating Degree-Bounded Network Design Problems. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 176, pp. 39:1-39:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.39

## Abstract

Directed Steiner Tree (DST) is a central problem in combinatorial optimization and theoretical computer science: Given a directed graph G = (V, E) with edge costs c ∈ ℝ_{≥ 0}^E, a root r ∈ V and k terminals K ⊆ V, we need to output a minimum-cost arborescence in G that contains an rrightarrow t path for every t ∈ K. Recently, Grandoni, Laekhanukit and Li, and independently Ghuge and Nagarajan, gave quasi-polynomial time O(log²k/log log k)-approximation algorithms for the problem, which are tight under popular complexity assumptions. In this paper, we consider the more general Degree-Bounded Directed Steiner Tree (DB-DST) problem, where we are additionally given a degree bound d_v on each vertex v ∈ V, and we require that every vertex v in the output tree has at most d_v children. We give a quasi-polynomial time (O(log n log k), O(log² n))-bicriteria approximation: The algorithm produces a solution with cost at most O(log nlog k) times the cost of the optimum solution that violates the degree constraints by at most a factor of O(log²n). This is the first non-trivial result for the problem. While our cost-guarantee is nearly optimal, the degree violation factor of O(log²n) is an O(log n)-factor away from the approximation lower bound of Ω(log n) from the Set Cover hardness. The hardness result holds even on the special case of the Degree-Bounded Group Steiner Tree problem on trees (DB-GST-T). With the hope of closing the gap, we study the question of whether the degree violation factor can be made tight for this special case. We answer the question in the affirmative by giving an (O(log nlog k), O(log n))-bicriteria approximation algorithm for DB-GST-T.

## Subject Classification

##### ACM Subject Classification
• Theory of computation → Routing and network design problems
##### Keywords
• Directed Steiner Tree
• Group Steiner Tree
• degree-bounded

## Metrics

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

## References

1. Yair Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. In 37th Annual Symposium on Foundations of Computer Science, FOCS '96, Burlington, Vermont, USA, 14-16 October, 1996, pages 184-193, 1996. URL: https://doi.org/10.1109/SFCS.1996.548477.
2. Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, and Ming Li. Approximation algorithms for directed steiner problems. J. Algorithms, 33(1):73-91, 1999. URL: https://doi.org/10.1006/jagm.1999.1042.
3. Sina Dehghani, Soheil Ehsani, Mohammad Taghi Hajiaghayi, Vahid Liaghat, Harald Räcke, and Saeed Seddighin. Online weighted degree-bounded steiner networks via novel online mixed packing/covering. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11-15, 2016, Rome, Italy, pages 42:1-42:14, 2016. URL: https://doi.org/10.4230/LIPIcs.ICALP.2016.42.
4. Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, and Vahid Liaghat. Online degree-bounded steiner network design. In Proceedings of the Twenty-seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '16, pages 164-175, Philadelphia, PA, USA, 2016. Society for Industrial and Applied Mathematics. URL: http://dl.acm.org/citation.cfm?id=2884435.2884448.
5. Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi, Vahid Liaghat, and Saeed Seddighin. Greedy algorithms for online survivable network design. In 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, pages 152:1-152:14, 2018. URL: https://doi.org/10.4230/LIPIcs.ICALP.2018.152.
6. Jittat Fakcharoenphol, Satish Rao, and Kunal Talwar. A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci., 69(3):485-497, 2004. URL: https://doi.org/10.1016/j.jcss.2004.04.011.
7. Zachary Friggstad, Jochen Könemann, Young Kun-Ko, Anand Louis, Mohammad Shadravan, and Madhur Tulsiani. Linear programming hierarchies suffice for directed steiner tree. In Integer Programming and Combinatorial Optimization - 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings, pages 285-296, 2014. URL: https://doi.org/10.1007/978-3-319-07557-0_24.
8. Martin Fürer and Balaji Raghavachari. Approximating the minimum-degree steiner tree to within one of optimal. J. Algorithms, 17(3):409-423, 1994. URL: https://doi.org/10.1006/jagm.1994.1042.
9. Naveen Garg, Goran Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group steiner tree problem. J. Algorithms, 37(1):66-84, 2000. URL: https://doi.org/10.1006/jagm.2000.1096.
10. Rohan Ghuge and Viswanath Nagarajan. A quasi-polynomial algorithm for submodular tree orienteering in directed graphs. CoRR, abs/1812.01768, 2018. URL: http://arxiv.org/abs/1812.01768.
11. Michel X. Goemans. Minimum bounded degree spanning trees. In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS '06, pages 273-282, Washington, DC, USA, 2006. IEEE Computer Society. URL: https://doi.org/10.1109/FOCS.2006.48.
12. Fabrizio Grandoni and Bundit Laekhanukit. Surviving in directed graphs: a quasi-polynomial-time polylogarithmic approximation for two-connected directed steiner tree. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017, pages 420-428, 2017. URL: https://doi.org/10.1145/3055399.3055445.
13. Fabrizio Grandoni, Bundit Laekhanukit, and Shi Li. O(log^2 k / log log k)-approximation algorithm for directed steiner tree: a tight quasi-polynomial-time algorithm. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, Phoenix, AZ, USA, June 23-26, 2019, pages 253-264, 2019. URL: https://doi.org/10.1145/3313276.3316349.
14. Mohammad Taghi Hajiaghayi. Open problems on bounded-degree network design from 8-th workshop on flexible network design, amsterdam, 2016. Announcement, 2016.
15. Eran Halperin and Robert Krauthgamer. Polylogarithmic inapproximability. In Lawrence L. Larmore and Michel X. Goemans, editors, Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pages 585-594. ACM, 2003. URL: https://doi.org/10.1145/780542.780628.
16. Jochen Könemann and R. Ravi. A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees. SIAM J. Comput., 31(6):1783-1793, 2002. URL: https://doi.org/10.1137/S009753970036917X.
17. Jochen Könemann and R. Ravi. Quasi-polynomial time approximation algorithm for low-degree minimum-cost steiner trees. In FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 23rd Conference, Mumbai, India, December 15-17, 2003, Proceedings, pages 289-301, 2003. URL: https://doi.org/10.1007/978-3-540-24597-1_25.
18. Jochen Könemann and R. Ravi. Primal-dual meets local search: Approximating msts with nonuniform degree bounds. SIAM J. Comput., 34(3):763-773, 2005. URL: https://doi.org/10.1137/S0097539702418048.
19. Guy Kortsarz and Zeev Nutov. Bounded degree group steiner tree problems. In IWOCA'20, to appear, 2020.
20. Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, and Mohit Singh. Survivable network design with degree or order constraints. SIAM J. Comput., 39(3):1062-1087, 2009. URL: https://doi.org/10.1137/070700620.
21. Lap Chi Lau and Mohit Singh. Additive approximation for bounded degree survivable network design. SIAM J. Comput., 42(6):2217-2242, 2013. URL: https://doi.org/10.1137/110854461.
22. R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, and Harry B. Hunt III. Many birds with one stone: multi-objective approximation algorithms. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, May 16-18, 1993, San Diego, CA, USA, pages 438-447, 1993. URL: https://doi.org/10.1145/167088.167209.
23. Thomas Rothvoß. Directed steiner tree and the lasserre hierarchy. CoRR, abs/1111.5473, 2011. URL: http://arxiv.org/abs/1111.5473.
24. Mohit Singh and Lap Chi Lau. Approximating minimum bounded degree spanning trees to within one of optimal. J. ACM, 62(1):1:1-1:19, 2015. URL: https://doi.org/10.1145/2629366.
25. Alexander Zelikovsky. A series of approximation algorithms for the acyclic directed steiner tree problem. Algorithmica, 18(1):99-110, 1997. URL: https://doi.org/10.1007/BF02523690.
X

Feedback for Dagstuhl Publishing

### Thanks for your feedback!

Feedback submitted

### Could not send message

Please try again later or send an E-mail