An approximation algorithm for minimum-cost vertex-connectivity problems
- 1 May 1997
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 18 (1) , 21-43
- https://doi.org/10.1007/bf02523686
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Improved Approximation Algorithms for Uniform Connectivity ProblemsJournal of Algorithms, 1996
- Computational Experience with an Approximation Algorithm on Large-Scale Euclidean Matching InstancesINFORMS Journal on Computing, 1996
- A primal-dual approximation algorithm for generalized steiner network problemsCombinatorica, 1995
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on NetworksSIAM Journal on Computing, 1995
- A General Approximation Technique for Constrained Forest ProblemsSIAM Journal on Computing, 1995
- On the Optimal Vertex-Connectivity AugmentationJournal of Combinatorial Theory, Series B, 1995
- Approximation Algorithms for Graph AugmentationJournal of Algorithms, 1993
- A minimum 3-connectivity augmentation of a graphJournal of Computer and System Sciences, 1993
- Methods for Designing Communications Networks with Certain Two-Connected Survivability ConstraintsOperations Research, 1989
- Augmentation ProblemsSIAM Journal on Computing, 1976