An efficient approximation algorithm for the survivable network design problem
- 1 June 1998
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 82 (1-2) , 13-40
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on NetworksSIAM Journal on Computing, 1995
- A General Approximation Technique for Constrained Forest ProblemsSIAM Journal on Computing, 1995
- A data structure for bicategories, with application to speeding up an approximation algorithmInformation Processing Letters, 1994
- Improved Approximations for the Steiner Tree ProblemJournal of Algorithms, 1994
- Biconnectivity approximations and graph carvingsJournal of the ACM, 1994
- Extracting maximal information about sets of minimum cutsAlgorithmica, 1993
- Survivable networks, linear programming relaxations and the parsimonious propertyMathematical Programming, 1993
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphsCombinatorica, 1986
- Approximation Algorithms for Several Graph Augmentation ProblemsSIAM Journal on Computing, 1981
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961