A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph

Journal of Algorithms

Volumn 32, Issue 1, 1999, Pages 21-30

  Auletta, Vincenzo ^a   Dinitz, Yefim ^b   Nutov, Zeev ^c   Parente, Domenico ^a  

^a UNIVERSITY OF SALERNO   (Italy)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001977155     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1006     Document Type: Article

References (18)

1. V. Auletta and D. Parente, Better algorithms for minimum-weight connectivity problems, in "Proc. 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS '97)" (R. Reischuk and M. Morvan, Eds.), Lecture Notes in Comput. Sci., Vol. 1200, pp. 547-558, Springer-Verlag, Berlin, 1997.
2. B. Bollobás, "Extremal Graph Theory," Chap. I, Academic Press, London, 1978.
3. J. Cheriyan and R. Thurimella, Approximating minimum-size k-connected spanning subgraphs via matching, in "Proc. 37th Annual IEEE Symp. on Foundations of Comp. Sci.," Oct. 1996, pp. 292-301.
4. Ye. Dinitz and Z. Nutov, A 3-approximation algorithm for finding optimum 4,5-vertex-connected spanning subgraphs, J. Algorithms 31 (1999), 31-40.
5. Ye. Dinitz and Z. Nutov, Finding minimum weight k-vertex connected spanning subgraphs: approximation algorithms with factor 2 for k = 3 and factor 3 for k = 4,5, in "Proc. 3rd Italian Conf. on Algorithms and Complexity, CIAC'97" (Rome, March 1997), Lecture Notes in Comp. Sci., vol. 1203, pp. 13-24, Springer-Verlag, 1997.
6. C. G. Fernandes, A better approximation ratio for the minimum k-edge-connected spanning subgraph problem, in "Proc. 8th Annual ACM-SIAM Symp. on Discrete Algorithms," pp. 629-638, 1997.
7. A. Frank, Connectivity augmentation problems in network design, in "Mathematical Programming, the State of the Art" (J. R. Birge and K. G. Murty, Eds), pp. 34-63, Springer-Verlag, New York/Berlin, 1994.
8. A. Frank and E. Tardos, An application of submodular flows, Linear Algebra and its Application, 114/115 (1989), 329-348.
9. H. N. Gabow, A representation for crossing set families with application to submodular flow problems, in "Proc. 4th Annual ACM-SIAM Symp. on Discrete Algorithms," pp. 202-211, 1993.
10. M. Grötschel, C. Monma, and M. Stoer, "Design of Survivable Networks. Handbook in Operation Research and Management Science," Vol. 7, Network Models" (M. O. Ball, T. L. Magnanti, C. L. Monma and G. L. Nemhauser, Eds.), 1993.
11. R. Halin, A theorem on n-connected graphs, J. Combin. Theory 7 (1969), 150-154.
12. S. Khuller, Approximation algorithms for finding highly connected subgraphs, in "Approximation Algorithms for NP-Hard Problems," (D. S. Hochbaum, Ed.), pp. 236-265, PWS, Boston, 1996.
13. S. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems, J. of Algorithms 21 (1996), 434-450.
14. S. Khuller and R. Thurimella, Approximation algorithms for graph augmentation, J. of Algorithms 14 (1993), 214-225.
15. Z. Nutov, "Improved Approximation Algorithms for Finding Optimum k-Vertex-Connected Spanning Subgraphs," TR CORR 98-03, Dept. of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada, Feb. 1998.
16. Z. Nutov and M. Penn, Faster approximation algorithms for weighted triconnectivity augmentation problems, Operations Research Letters 21 (1997), 219-223.
17. M. Penn and H. Shasha-Krupnik, Improved approximation algorithms for weighted 2 & 3 vertex connectivity augmentation problems, J. of Algorithms 22 (1997), 187-196.
18. R. Ravi and D. P. Williamson, An approximation algorithm for minimum-cost vertex-connectivity problems, Algorithmica 18 (1997), 21-43.