A primal-dual approximation algorithm for generalized steiner network problems
- 1 September 1995
- journal article
- research article
- Published by Springer Nature in Combinatorica
- Vol. 15 (3) , 435-454
- https://doi.org/10.1007/bf01299747
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Survivable networks, linear programming relaxations and the parsimonious propertyMathematical Programming, 1993
- An 11/6-approximation algorithm for the network steiner problemAlgorithmica, 1993
- A fast approximation algorithm for the multicovering problemDiscrete Applied Mathematics, 1986
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative DataMathematics of Operations Research, 1982
- Approximation Algorithms for Several Graph Augmentation ProblemsSIAM Journal on Computing, 1981