Approximation Algorithms
Survivable Network Design · SpringerReference · 2011
Cited by 3,190 works. doi:10.1007/springerreference_57547
References
- The Traveling salesman problem: a computational study
- A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
- Design of Survivable Networks
- Worst-case comparison of valid inequalities for the TSP
- Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
- Optimizing over the subtour polytope of the travelling salesman problem
- An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
- Additive guarantees for degree bounded directed network design
- Approximating the smallest k-edge connected spanning subgraph by LP-rounding