Improved approximation algorithms for network design problems
Michel X. Goemans, Andrew V. Goldberg, Serge A. Plotkin et al. · eCommons (Cornell University) · 1994
Improved approximation algorithms for network design problems
Cited by 185 works. doi:10.5555/314464.314497 Open-access PDF
Authors
References
- Geometric Algorithms and Combinatorial Optimization
- Network Design and Transportation Planning: Models and Algorithms
- A General Approximation Technique for Constrained Forest Problems
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- A new algorithm for minimizing convex functions over convex sets
- Survivable networks, linear programming relaxations and the parsimonious property
- A primal-dual approximation algorithm for generalized Steiner network problems
- On the structure of all minimum cuts in a network and applications
- An efficient approximation algorithm for the survivable network design problem
- When Cycles Collapse: A General Approximation Technique for Constrained Two-Connectivity Problems