A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
Kamal Kishore Jain · COMBINATORICA · 2001
Cited by 540 works. doi:10.1007/s004930170004
Authors
References
- Multi-Terminal Network Flows
- A General Approximation Technique for Constrained Forest Problems
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- A new algorithm for minimizing convex functions over convex sets
- On the bidirected cut relaxation for the metric Steiner tree problem
- A primal–dual schema based approximation algorithm for the element connectivity problem
- Approximating Minimum-Size k -Connected Spanning Subgraphs via Matching