Approximation algorithms for minimum size 2-connectivity problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2010, Issue , 2001, Pages 431-442

  Krysta1, Piotr ^a   Anil Kumar, V S ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPHIC METHODS; LINEAR PROGRAMMING;

CONNECTED SUBGRAPH; CONNECTIVITY PROBLEMS; CUBIC PLANAR GRAPHS; GENERAL GRAPH; INTEGRALITY GAPS; LINEAR PROGRAMMING FORMULATION; LOCAL OPTIMIZATIONS; VERTEX DISJOINT PATHS;

GRAPH THEORY;

EID: 84957056037     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_38     Document Type: Conference Paper

References (14)

1. R. Carr and R. Ravi. A new bound for the 2-edge connected subgraph problem. In the Proc. 6th IPCO, LNCS 1412, 1998.
2. J. Cheriyan, A. Sebő and Z. Szigeti. An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs. In the Proc. 6th IPCO, LNCS 1412, 1998.
3. C.G. Fernandes. A better approximation ratio for the minimum size k-edge-connected spanning subgraph problem. Journal of Algorithms, 28, pp. 105-124, 1998.
4. A. Frank. Conservative weightings and ear-decompositions of graphs. Combinatorica, 13, pp. 65-81, 1993.
5. N. Garg, V. Santosh and A. Singla. Improved Approximation Algorithms for Biconnected Subgraphs via Better Lower Bounding Techniques. In the Proc. 4th ACM-SIAM SODA, pp. 103-111, 1993.
6. M.X. Goemans, A. Goldberg, S. Plotkin, D.B. Shmoys, È. Tardos and D.P. Williamson. Improved Approximation Algorithms for Network Design Problems. In the Proc. 5th ACMSIAM SODA, pp. 223-232, 1994.
7. R.L. Graham, M. Grötschel and L. Lovász, editors. Handbook of Combinatorics. Volume I. North-Holland, 1995.
8. M. Grigni, E. Koutsoupias and C.H. Papadimitriou. An approximation scheme for planar graph TSP. In the Proc. of the IEEE FOCS, 1995.
9. M. Grötschel, C. Monma and M. Stoer. Design of survivable networks. In Handbook in Operations Research and Management Science, Volume on Networks. North-Holland, 1995.
10. K. Jain. A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem. In the Proc. of the IEEE FOCS, 1998.
11. S. Khuller and U. Vishkin. Biconnectivity Approximations and Graph Carvings. Journal of the ACM, 41(2), pp. 214-235, 1994.
12. H. Nagamochi and T. Ibaraki. A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica, 7, pp. 583-596, 1992.
13. R. Ravi and D.P. Williamson. An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. Algorithmica, 18(1), pp. 21-43, 1997.
14. S. Vempala and A. Vetta. Factor 4/3 Approximations for Minimum 2-Connected Subgraphs. In the Proc. 3rd International Workshop APPROX, LNCS 1913, 2000.