An Efficient Approximation Algorithm for the Survivable Network Design Problem (1993)
Cached
Download Links
- [www.cs.colorado.edu]
- [www-math.mit.edu]
- [www-math.mit.edu]
- [math.mit.edu]
- [www.research.ibm.com]
- DBLP
Other Repositories/Bibliography
by
Harold N. Gabow
,
Michel X. Goemans
,
David P. Williamson
| Venue: | IN PROCEEDINGS OF THE THIRD MPS CONFERENCE ON INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION |
| Citations: | 50 - 7 self |
BibTeX
@INPROCEEDINGS{Gabow93anefficient,
author = {Harold N. Gabow and Michel X. Goemans and David P. Williamson},
title = {An Efficient Approximation Algorithm for the Survivable Network Design Problem},
booktitle = {IN PROCEEDINGS OF THE THIRD MPS CONFERENCE ON INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION},
year = {1993},
pages = {57--74},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The survivable network design problem is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximation algorithm was given by Williamson et al. [20]. This paper gives an improved version that is more efficient. Consider a graph
