An efficient approximation algorithm for the survivable network design problem

Mathematical Programming, Series B

Volumn 82, Issue 1-2, 1998, Pages 13-40

  Gabow, Harold N ^a   Goemans, Michel X ^b   Williamson, David P ^c  

^a UNIVERSITY OF COLORADO   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Approximation algorithm; Network design; Steiner tree

Indexed keywords

EID: 0008774744     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01585864     Document Type: Article

References (23)

1. A. Agrawal, P. Klein, R. Ravi, When trees collide: An approximation algorithm for the generalized Steiner problem on networks, SIAM Journal on Computing 24 (1995) 440-456.
2. P. Berman, V. Ramaiyer, Improved approximations for the Steiner tree problem. Journal of Algorithms 17 (1994) 381-408
3. G.N. Frederickson, J. Ja'Ja', Approximation algorithms for several graph augmentation problems, SIAM Journal on Computing 10 (1981) 270-283.
4. H. N Gabow, Z. Galil, T.H. Spencer, R.E. Tarjan, Efficient algorithms for finding minimum spanning trees in undirected and directed graphs, Combinatorica 6 (1986) 109-122.
5. H.N. Gabow, M.X. Goemans, D.P. Williamson, An efficient approximation algorithm for the survivable networks design problems, in: Proceedings of the Third MPS Conference on Integer Programming and Combinatorial Optimization, 1993, pp. 57-74.
6. M. Goemans, A. Goldberg, S. Plotkin, D. Shmoys, E. Tardos, D. Williamson, Improved approximation algorithms for network design problems, in: Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 223-232.
7. M.X. Goemans, D.J. Bertsimas, Survivable networks, linear programming relaxation and the parsimonious property, Mathematical Programming 60 (1993) 145-166.
8. M.X. Goemans, D.P. Williamson, A general approximation technique for constrained forest problems, SIAM Journal on Computing 24 (1995) 296-317.
9. R. Gomory, T. Hu, Multi-terminal network flows, SIAM Journal of Applied Mathematics 9 (1961) 551-570.
10. M. Grötschel, C.L. Monma, M. Stoer, Design of survivable networks, in: Network Models (Handbooks in Operations Research and Management Science, vol.7), M.O. Bell, T.L. Magnant, C.L. Monma, G.L. Nemhauser, eds, North-Holland, 1995.
11. D. Gusfield, D. Naor, Extracting maximal information about sets of minimum cuts, Algorithmica 10 (1993) 64-89.
12. S. Khuller, U. Vishkin, Biconnectivity approximations and graph carvings, Journal of the ACM 41 (1994) 214-235.
13. P. Klein, R. Ravi, When cycles collapse: A general approximation technique for constrained two-connectivity problems, in: Proceedings of the Third MPS Conference on Integer Programming and Combinatorial Optimization, 1993, pp. 39-55 (also appears as Brown University Technical Report CS-92-30, to appear in Algorithmica).
14. P. Klein, R. Ravi, When cycles collapse: A general approximation technique for constrained two-connectivity problems, in: Proceedings of the Third MPS Conference on Integer Programming and Combinatorial Optimization, 1993, pp. 39-55 (also appears as Brown University Technical Report CS-92-30, to appear in Algorithmica).
15. P.N. Klein, A data structure for bicategories, with application to speeding up an approximation algorithm, Information Processing Letters 52 (1994) 303-307.
16. K. Mehlhorn, A faster approximation algorithm for the Steiner problem in graphs, Information Processing Letters 27 (1988) 125-128.
17. M.W. Padberg, M. Rao, Odd minimum cut-sets and b-matchings, Mathematics of Operations Research 7 (1982) 67-80.
18. J. Picard, M. Queyranne, On the structure of all minimum cuts in a network and applications, Mathematical Programming Study 13 (1980) 8-16.
19. R. Ravi, P. Klein, Approximation through uncrossing, unpublished manuscript.
20. D.P. Williamson, On the design of approximation algorithms for a class of graph problems, Ph.D. Thesis, MIT, Cambridge, MA, 1993 (also appears as Tech. Report MIT/LCS/TR-584).
21. D.P. Williamson, On the design of approximation algorithms for a class of graph problems, Ph.D. Thesis, MIT, Cambridge, MA, 1993 (also appears as Tech. Report MIT/LCS/TR-584).
22. D.P. Williamson, M.X. Goemans, M. Mihail, V.V. Vazirani, A primal-dual approximation algorithm for generalized Steiner network problems, Combinatorica 15 (1995) 435-454.
23. A. Zelikovsky, An 11/6-approximation algorithm for the network Steiner problem, Algorithmica 9 (1993) 463-470.