Improving on the 1.5-approximation of a smallest 2-edge connected spanning subgraph

SIAM Journal on Discrete Mathematics

Volumn 14, Issue 2, 2001, Pages 170-180

  Cheriyan, J ^a   Sebo, A ^b   Szigeti, Z ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b CNRS   (France)

^c SORBONNE UNIVERSITÉ   (France)

Author keywords

Approximation algorithms; Ear decomposition; Edge connectivity; Graphs; Joins; Metric traveling salesman problem and 4 3 conjecture; NP complete problems

Indexed keywords

EID: 0038099192     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480199362071     Document Type: Article

References (19)

1. R. CARR AND R. RAVI, A new bound for the 2-edge connected subgraph problem, in Proceedings of the Sixth International Integer Programming and Combinatorial Optimization Conference, Houston, Texas, 1998, Lecture Notes in Comput. Sci. 1412, R.E. Bixby, E.A. Boyd, R.Z. Rios-Mercado, eds., Springer-Verlag, Berlin, pp.112-125.
2. J. CHERIYAN, A. SEBO, AND Z. SZIGETI, An improved approximation algorithm for minimum size 2-edge connected spanning subgraphs, in Proceedings of the Sixth International Integer Programming and Combinatorial Optimization Conference, Houston, Texas, 1998, Lecture Notes in Comput. Sci. 1412, R.E. Bixby, E.A. Boyd, R.Z. Rios-Mercado, eds., Springer-Verlag, Berlin, pp. 126-136.
3. J. CHERIYAN AND R. THURIMELLA, Approximating minimum-size k-connected spanning subgraphs via matching, in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1996, pp. 292-301; SIAM J. Sci. Comput., 30 (2000), pp. 528-560.
4. J. CHERIYAN AND R. THURIMELLA, Approximating minimum-size k-connected spanning subgraphs via matching, in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1996, pp. 292-301; SIAM J. Sci. Comput., 30 (2000), pp. 528-560.
5. N. CHRISTOFIDES, Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem, Technical report, G.S.I.A., Carnegie-Mellon University, Pittsburgh, PA, 1976.
6. A. FRANK, Conservative weightings and ear-decompositions of graphs, Combinatorica, 13 (1993), pp. 65-81.
7. A. FRANK, A. SEBO, AND E. TARDOS, Covering directed and odd cuts, Math. Programming Stud., 22 (1984), pp. 99-112.
8. G. L. FREDERICKSON AND J. JA'JA', On the relationship between the biconnectivity augmentation and traveling salesman problems, Theoret. Comput. Sci., 19 (1982), pp. 189-201.
9. N. GARG, V. S. SANTOSH, AND A. SINGLA, Improved approximation algorithms for biconnected subgraphs via better lower bounding techniques, in Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, Austin, TX, 1993, ACM, New York, pp. 103-111.
10. M X. GOEMANS AND D. J. BERTSIMAS, Survivable networks, linear programming relaxations and the parsimonious property, Math. Program., 60 (1993), pp. 143-166.
11. T. HUH, On 2-edge connected spanning subgraphs, M. Math essay, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada, 1998.
12. S. KHULLER AND U. VISHKIN, Biconnectivity approximations and graph carvings, J. ACM, 41 (1994), pp. 214-235. A preliminary version appears in Proceeding of the 24th Annual ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 759-770.
13. S. KHULLER AND U. VISHKIN, Biconnectivity approximations and graph carvings, J. ACM, 41 (1994), pp. 214-235. A preliminary version appears in Proceeding of the 24th Annual ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 759-770.
14. L. LOVÁSZ, A note on factor-critical graphs, Studia Sci. Math. Hungar., 7 (1972), pp. 279-280.
15. L. LOVÁSZ AND M. D. PLUMMER, Matching Theory, Akadémiai Kiadó, Budapest, 1986.
16. C. L. MONMA, B. S. MUNSON, AND W. R. PULLEYBLANK, Minimum-weight two-connected spanning networks, Math. Program., 46 (1990), pp. 153-171.
17. S. VEMPALA AND A. VETTA, Factor 4/3 approximations for minimum 2-connected subgraphs, in Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 2000, Springer, Berlin, 2000, pp. 262-273.
18. H. WHITNEY, Nonseparable and planar graphs, Trans. Amer. Math. Soc., 34 (1932), pp. 339-362.
19. L. A. WOLSEY, Heuristic analysis, linear programming and branch and bound, Math. Program. Stud., 13 (1980), pp. 121-134.