Abstract
We present an approximation algorithm for solving graph problems in which a low-cost set of edges must be selected that has certain vertex-connectivity properties. In the survivable network design problem, a valuer ij for each pair of verticesi andj is given, and a minimum-cost set of edges such that there arer ij vertex-disjoint paths between verticesi andj must be found. In the case for whichr ij ∈{0, 1, 2} for alli, j, we can find a solution of cost no more than three times the optimal cost in polynomial time. In the case in whichr ij =k for alli, j, we can find a solution of cost no more than 2H(k) times optimal, where\(\mathcal{H}(n) = 1 + \tfrac{1}{2} + \cdot \cdot \cdot + \tfrac{1}{n}\). No approximation algorithms were previously known for these problems. Our algorithms rely on a primal-dual approach which has recently led to approximation algorithms for many edge-connectivity problems.
Similar content being viewed by others
References
A. Agrawal, P. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized Steiner problem on networks.SIAM Journal on Computing, 24:440–456, 1995.
K. P. Eswaran and R. E. Tarjan. Augmentation problems.SIAM Journal on Computing, 5:653–665, 1976.
M. Goemans, A. Goldberg, S. Plotkin, D. Shmoys, E. Tardos, and D. Williamson. Improved approximation algorithms for network design problems. InProceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 223–232, 1994.
M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems.SIAM Journal on Computing, 24:296–317, 1995.
M. Grötschel, C. L. Monma, and M. Stoer. Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints.Operations Research, 40:309–330, 1992.
F. Harary. The maximum connectivity of a graph.Proceedings of the National Academy of Sciences, USA, 48:1142–1146, 1962.
T. Hsu. On four-connecting a triconnected graph. InProceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 70–79, 1992.
T. Hsu and V. Ramachandran. A linear time algorithm for triconnectivity augmentation. InProceedings of the 32nd Annual Symposium on Foundations of Computer Science, pages 548–559, 1991.
T. Jordán. On the optimal vertex-connectivity augmentation.Journal of Combinatorial Theory, Series B, 63:8–20, 1995.
S. Khuller and B. Raghavachari. Improved approximation algorithms for uniform connectivity problems.Journal of Algorithms, 21:434–450, 1996.
S. Khuller and R. Thurimella. Approximation algorithms for graph augmentation.Journal of Algorithms, 14:214–225, 1993.
P. Klein and R. Ravi. When cycles collapse: A general approximation technique for constrained two-connectivity problems. InProceedings of the Third MPS Conference on Integer Programming and Combinatorial Optimization, pages 39–55, 1993. Also appears as Technical Report CS-92-30, Brown University.
K. Menger. Zur allgemeinen Kurventheorie.Fundamenta Mathematicae, 10:96–115, 1927.
M. Mihail, D. Shallcross, N. Dean, and M. Mostrel. A commercial application of survivable network design: ITP/INPLANS CCS Network Topology Analyzer. InProceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 279–287, 1996.
C. L. Monma and D. F. Shallcross. Methods for designing communication networks with certain two-connected survivability constraintsOperations Research, pages 531–541, 1989.
C. H. Papadimitriou and K. SteiglitzCombinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982.
M. Rauch. Improved data structures for fully dynamic biconnectivity. InProceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 686–695, 1994. Submitted toSIAM Journal on Computing.
R Ravi and D. P. Williamson. An approximation algorithm for minimum-cost vertex-connectivity problems. InProceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 332–341, 1995.
K. Steiglitz, P. Weiner, and D. Kleitman. The design of minimal cost survivable networksIEEE Transactions on Circuit Theory, 16:455–460, 1969.
M. Stoer.Design of Survivable Networks. Lecture Notes in Mathematics, volume 1531. Springer-Verlag, Berlin, 1992.
T. Watanabe and A. Nakamura. A minimum 3-connectivity augmentation of a graph.Journal of Computer and System Sciences, 46:91–128, 1993.
D. P. Williamson. On the design of approximation algorithms for a class of graph problems. Ph.D. thesis, MIT, Cambridge, MA, September 1993. Also appears as Technical Report MIT/LCS/TR-584.
D. P. Williamson and M. X. Goemans. Computational experience with an approximation algorithm on large-scale Euclidean matching instances.INFORMS Journal on Computing, 8:29–40, 1996.
D. P. Williamson., M. X. Goemans, M. Mihail, and V. V. Vazirani. A primal-dual approximation algorithm for generalized Steiner network problems.Combinatorica, 15:435–454, 1995.
Author information
Authors and Affiliations
Additional information
Communciated by M. X. Goemans.
This research was supported by NSF Grant CCR-91-03937 and a DIMACS postdoctoral fellowship, and was conducted in part while the author was visiting MIT.
This research was supported by an NSF Graduate Fellowship and an NSF Postdoctoral Fellowship, and was conducted in part while the author was a graduate student at MIT and in part while a postdoc at Cornell.
Rights and permissions
About this article
Cite this article
Ravi, R., Williamson, D.P. An approximation algorithm for minimum-cost vertex-connectivity problems. Algorithmica 18, 21–43 (1997). https://doi.org/10.1007/BF02523686
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02523686