Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
Lisa Fleischer, Kamal Kishore Jain, David P. Williamson · Journal of Computer and System Sciences · 2006
Cited by 121 works. doi:10.1016/j.jcss.2005.05.006
Authors
References
- Graph Theory
- Geometric Algorithms and Combinatorial Optimization
- A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
- Design of Survivable Networks
- Geometric Algorithms and Combinatorial Optimization
- Improved approximation algorithms for network design problems
- Improved Approximation Algorithms for Uniform Connectivity Problems
- A primal–dual schema based approximation algorithm for the element connectivity problem
- An approximation algorithm for minimum-cost vertex-connectivity problems
- Hardness of Approximation for Vertex-Connectivity Network Design Problems