Primal-dual approximation algorithms for the survivable network design problem
We consider the survivable network design problem (SNDP), the problem of designing a minimum cost network satisfying connectivity requirements between pairs of vertices. We describe a heuristic algorithm with a provable worst-case performance guarantee for this problem, as well as for a host of related problems. The algorithm is primal-dual and generalizes exact algorithms for the shortest path and minimum spanning tree problems. The most recent version of the algorithm, due to M. Goemans, A. Goldberg, S. Plotkin, D. Shmoys, {acute E}. Tardos and D. Williamson, has the best known performance guarantee both in general and for most special cases. The talk will be a survey of a stream of results of the authors and a number of colleagues, including the above-mentioned researchers and H. Gabow, M. Mihail and V. Vazirani. The emphasis of the talk will be on the methodology behind this approximation algorithm.
- OSTI ID:
- 36068
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Implementation of the primal-dual interior-point algorithm for the solution of the minimum cost network flow problem
Solving nonlinear multicommodity flow problems with the analytic center cutting plane method