An O(log2 k)-Approximation algorithm for the k-Vertex connected spanning subgraph problem

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 153-158

  Fakcharoenphol, Jittat ^a   Laekhanukit, Bundit ^b  

^a KASETSART UNIVERSITY   (Thailand)

^b KASETSART UNIVERSITY   (Thailand)

Author keywords

Approximation algorithms; Graph connectivity

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; DIRECTED GRAPHS;

CONNECTED SPANNING SUBGRAPH PROBLEMS; GRAPH CONNECTIVITY; INPUT GRAPHS; MINIMUM COST; OPTIMAL SOLUTIONS; SUBGRAPHS; UNDIRECTED GRAPH;

APPROXIMATION ALGORITHMS;

EID: 57049099296     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374401     Document Type: Conference Paper

References (21)

1. J. Cheriyan and R. Thurimella. Approximating minimum-size k-connected spanning subgraphs via matching. SIAM J. Comput., 30(2):528-560, 2000.
2. J. Cheriyan, S. Vempala, and A. Vetta. An approximation algorithm for the minimum-cost k-vertex connected subgraph. SIAM J. Comput, 32(4): 1050-1055, 2003.
3. Czumaj and Lingas. On approximability of the minimum-cost k-connected spanning subgraph problem. In SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms), 1999.
4. A. Frank and T. Jordan. Minimal edge-coverings of pairs of sets. J. Comb. Theory Ser. B, 65(1):73-110, 1995.
5. A. Frank and E. Tardos. An application of submodular flows. Linear Algebra and its Applications, 1989.
6. H. N. Gabow. Using expander graphs to find vertex connectivity. J. ACM, 53(5):800-844, 2006.
7. H. N. Gabow, M. X. Goemans, É. Tardos, and D. P. Williamson. Approximating the smallest -edge connected spanning subgraph by lp-rounding. In SODA, pages 562-571, 2005.
8. M. X. Goemans, A. V. Goldberg, S. A. Plotkin, D. B. Shmoys, É. Tardos, and D. P. Williamson. Improved approximation algorithms for network design problems. In SODA, pages 223-232, 1994.
9. M. R. Henzinger, S. Rao, and H. N. Gabow. Computing vertex connectivity: new bounds from old techniques. J. Algorithms, 34(2):222-250, 2000.
10. K. Jain. A factor 2 approximation algorithm for the generalized steiner network problem. In FOCS '98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, page 448, Washington, DC, USA, 1998. IEEE Computer Society.
11. T. Jordán. On the optimal vertex-connectivity augmentation. J. Comb. Theory Ser. B, 63(l):8-20, 1995.
12. S. Khuller and B. Raghavachari. Improved approximation algorithms for uniform connectivity problems. J. Algorithms, 21(2):434-450, 1996.
13. S. Khuller and U. Vishkin. Biconnectivity approximations and graph carvings. J. ACM, 41(2):214-235, 1994.
14. G. Kortsarz and Z. Nutov. Approximating node connectivity problems via set covers. Algorithmica, 37(2):75-92, 2003.
15. G. Kortsarz and Z. Nutov. Approximation algorithm for k-node connected subgraphs via critical graphs. In STOC '04: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 1.38-145, New York, NY, USA. 2004. ACM.
16. G. Kortsarz and Z. Nutov. Handbook on Approximation Algorithms an Metaheuristics, chapter Approximating min-cost connectivity problems. Chapman and Hall, 2006.
17. W. Mader. Endlichkeitsätze für k-kritische graphen (german). Math. Ann., 229:143-153, 1977.
18. W. Mader. Connectivity and edge-connectivity in finite graphs. In in: B. Bollobas (Ed.), Surveys on Combinatorics, Lecture Note Series, London Mathematical Society, volume 38, pages 293-309. 1979.
19. R. Ravi and D. R Williamson. An approximation algorithm for minimum-cost vertex-connectivity problems. In SODA '95: Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, pages 332-341, Philadelphia, PA, USA, 1995. Society for Industrial and Applied Mathematics.
20. R. Ravi and D. P. Williamson. Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems. In SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pages 1000-1001, Philadelphia, PA. USA, 2002. Society for Industrial and Applied Mathematics.
21. G. Robins and A. Zelikovsky. Tighter bounds for graph steiner tree approximation. SIAM J. Discrete Math., 19(1): 122-134, 2005.