A 5/4-approximation algorithm for minimum 2-edge-connectivity

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 725-734

  Jothi, Raja ^a   Raghavachari, Balaji ^a   Varadarajan, Subramanian ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; DATA STRUCTURES; GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

EDGE CONNECTIVITY; EDGE CONNECTIVITY SURVIVABLE NETWORK DESIGN PROBLEM; SPANNING SUBGRAPH PROBLEM;

ALGORITHMS;

EID: 0038754084     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. J. Cheriyan, A. Sebö, Z. Szigeti. Improving on the 1.5 approximation of a smallest 2-edge connected spanning subgraph, SIAM J. Discret. Math., 14, pp. 170-180, 2001.
2. J. Cheriyan, S. Vempala and A. Vetta, Approximation algorithms for minimum-cost k-connected subgraphs, Proc. of the 34th ACM Symposium on the Theory of Computing (STOC), 2002.
3. J. Cheriyan and R. Thurimella, Approximating minimum-size κ-connected spanning subgraphs via Matching, SIAM J. Comput., 30, pp. 528-560, 2000.
4. A. Czumaj and A. Lingas, On approximality of the minimum-cost κ-connected spanning subgraph problem, Proc. 10th Annual ACM-SIAM Symposium on Discret. Alg. (SODA), pp. 281-290, 1999.
5. J. Edmonds, Matroid intersection, Annals of Discret. Math., 14, pp. 39-49, 1979.
6. C. G. Fernandes, A better approximation for the minimum k-edge-connected spanning subgraph problem, J. Algorithms, 28, pp. 105-124, 1998.
7. A. Frank and E. Tardos, An application of sub-modular flows, Linear Algebra and its Applications, 114/115, pp. 320-348, 1989.
8. H. N. Gabow, An ear decomposition approach to approximating the smallest 3-edge connecte spanning subgraph of a multigraph, Proc. 13th Annual ACM-SIAM Symp. on Discret. Algorithms (SODA), pp. 84-93, 2002.
9. H. N. Gabow, Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph, Proc. 14th Annual ACM-SIAM Symp. on Discret. Algorithms (SODA), 2003.
10. M. R. Garey and D. S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W. H. Freeman, San Francisco, 1979.
11. N. Garg, V. Santosh and A. Singla, Improved approximation algorithms for biconnected subgraphs via better lower bounding techniques, Proc. 4th Annual ACM-SIAM Symp. on Discret. Algorithms (SODA), pp. 103-111, 1993.
12. D. Hartvigsen, Extensions of matching theory, Ph.D. Thesis, Carnegie-Mellon University, 1984.
13. D. Hartvigsen, The square-free 2-factor problem in bipartite graphs, Proc. of the 7th Integer Programming and Combinatorial Optimization Conference (IPCO), pp. 234-241, 1999.
14. A. Itai, C.H. Papadimitriou, and J.L. Szwarcfiter, Hamilton paths in grid graphs, SIAM J. Comput., pp 676-686, 1982.
15. S. Khuller and B. Raghavachari, Improved approximation algorithms for uniform connectivity problems, J. Algorithms, 21, pp. 433-450, 1996.
16. S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings, J. Assoc. Comput. Mach., 41, pp. 214-235, 1994.
17. P. Krysta and V. S. Anil Kumar, Approximation algorithms for minimum size 2-connectivity problems, Proc. 18th Intl. Symposium on Theoretical Aspects of Computer Science (STACS), pp. 431-442, 2001.
18. H. Nagamochi and T. Ibaraki. Linear time algorithms for finding sparse k-connected spanning subgraph of a k-connected graph, Algorithmica, 7, pp. 583-596, 1992.
19. S. Vempala and A. Vetta, Factor 4/3 approximations for minimum 2-connected subgraphs, Approx 2000, pp. 262-273, 2000.