Abstract
The classical algorithm of Agrawal et al. (SIAM J Comput 24(3):440–456, 1995), stated in the setting of the primal-dual schema by Goemans and Williamson (SIAM J Comput 24(2):296–317, 1995) uses the undirected cut relaxation for the Steiner forest problem. Its approximation ratio is \(2-\frac{1}{k}\), where k is the number of terminal pairs. A variant of this algorithm more recently proposed by Könemann et al. (SIAM J Comput 37(5):1319–1341, 2008) is based on the lifted cut relaxation. In this paper, we continue this line of work and consider the bidirected cut relaxation for the Steiner forest problem, which lends itself to a novel algorithmic idea yielding the same approximation ratio as the classical algorithm. In doing so, we introduce an extension of the primal-dual schema in which we run two different phases to satisfy connectivity requirements in both directions. This reveals more about the combinatorial structure of the problem. In particular, there are examples on which the classical algorithm fails to give a good approximation, but the new algorithm finds a near-optimal solution.
Similar content being viewed by others
References
Agrawal A, Klein PN, Ravi R (1991) When trees collide: an approximation algorithm for the generalized Steiner problem on networks. In: Proceedings of the 23rd annual ACM symposium on theory of computing (STOC), pp 134–144
Agrawal A, Klein PN, Ravi R (1995) When trees collide: an approximation algorithm for the generalized Steiner problem on networks. SIAM J Comput 24(3):440–456
Chopra S, Rao MR (1994) The Steiner tree problem I: formulations, compositions and extension of facets. Math Program 64:209–229
Goemans MX, Myung Y-S (1993) A catalog of steiner tree formulations. Networks 23(1):19–28
Goemans MX, Williamson DP (1995) A general approximation technique for constrained forest problems. SIAM J Comput 24(2):296–317
Goemans MX et al (1994) Improved approximation algorithms for network design problems. In: Proceedings of the 5th annual ACM-SIAM symposium on discrete algorithms (SODA), pp 223–232
Groß M, Gupta A, Kumar A, Matuschke J, Schmidt DR, Schmidt M, Verschae J (2018) A local-search algorithm for Steiner forest. In: 9th innovations in theoretical computer science conference, ITCS. pp 31:1–31:17
Gupta A, Kumar A (2015) Greedy algorithms for Steiner forest. In: Proceedings of the 47th annual ACM symposium on theory of computing (STOC), pp 871–878
Könemann J et al (2008) A group-strategyproof cost sharing mechanism for the Steiner forest game. SIAM J Comput 37(5):1319–1341
Williamson DP, Shmoys DB (2011) The design of approximation algorithms. Cambridge University Press, Cambridge
Williamson DP et al (1995) A primal-dual approximation algorithm for generalized Steiner network problems. Combinatorica 15:708–717
Acknowledgements
We would like to thank David P. Williamson for answering questions on the classical primal-dual algorithm for Steiner forest during the early stages of our investigation. This work was supported by TUBITAK (Scientific and Technological Research Council of Turkey) under Project No. 112E192.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Çivril, A. Approximation of Steiner forest via the bidirected cut relaxation. J Comb Optim 38, 1196–1212 (2019). https://doi.org/10.1007/s10878-019-00444-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-019-00444-8