Approximation schemes for minimum 2-connected spanning subgraphs in weighted planar graphs

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 472-483

  Berger, André ^a   Czumaj, Artur ^b   Grigni, Michelangelo ^a   Zhao, Hairong ^b  

^a EMORY UNIVERSITY   (United States)

^b University Heights   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY;

APPROXIMATION RATIO; PLANAR GRAPHS; POLYNOMIAL TIME APPROXIMATION; SUBGRAPHS;

GRAPH THEORY;

EID: 27144464122     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_43     Document Type: Conference Paper

References (23)

1. I. Althöfer, G. Das, D. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete Comput. Geom., 9: 81-100, 1993.
2. S. Arora, M. Grigni, D. Karger, P. Klein, and A. Woloszyn. A polynomial time approximation scheme for weighted planar graph TSP. SODA 1998, pp. 33-41.
3. A. Berger, M. Grigni and H. Zhao. A well-connected separator for planar graphs. Manuscript, 2004.
4. J. Cheriyan, S. Vempala and A. Vetta. An approximation algorithm for the minimum-size k-vertex connected subgraph. SIAM J. Comput., 32(4):1050-1055, 2003.
5. A. Czumaj, M. Grigni, P. Sissokho, and H. Zhao. Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. SODA 2004, pp. 489-498.
6. A. Czumaj and A. Lingas. On approximability of the minimum-cost k-connected spanning subgraph problem. SODA 1999, pp. 281-290.
7. A. Czumaj and A. Lingas. Fast approximation schemes for Euclidean multi-connectivity problems. ICALP 2000, pp. 856-868.
8. A. Czumaj, A. Lingas, and H. Zhao Polynomial-time approximation schemes for the Euclidean survivable network design problem. ICALP 2002, pp. 973-984.
9. L. Fleischer. A 2-approximation for minimum cost {0, 1, 2} vertex connectivity. IPCO 2001, pp. 115-129.
10. H. N. Gabow. An ear decomposition approach to approximating the smallest 3-edge connected spanning subgraph of a multigraph. SODA 2002, pp. 84-93.
11. H. N. Gabow. Better performance bounds for finding the smallest k-edge connected spanning subgraph of a multigraph. SODA 2003, pp. 460-469.
12. M. Grötschel, C. L. Monma, and M. Stoer. Design of survivable networks. In M. O. Ball et al., eds., Handbooks in Operations Research and Management Science, vol 7: Network Models, chapter 10, pp. 617-672. North-Holland, Amsterdam, 1995.
13. K. Jain. A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica, 21(1):39-60, 2001.
14. R. Jothi, B. Raghavachari, and S. Varadarajan. A 5/4-approximation algorithm for minimum 2-edge-connectivity. SODA 2003, pp. 725-734.
15. S. Khuller. Approximation algorithms for finding highly connected subgraphs. In D. S. Hochbaum, ed., Approximation Algorithms for NP-Hard Problems, pp. 236-265, 1996.
16. S. Khuller and U. Vishkin. Biconnectivity approximations and graph carvings. Journal of the ACM, 41(2):214-235, March 1994.
17. G. Kortsarz and Z. Nutov. Approximation algorithm for k-node connected subgraphs via critical graphs. STOC 2004, pp. 138-145.
18. P. Krysta. Approximating minimum size 1,2-connected networks, Discrete Appl. Math., 125:267-288, 2003.
19. C. Levcopoulos, G. Narasimhan, and M. H. M. Smid. Efficient algorithms for constructing fault-tolerant geometric spanners. STOC 1998, pp. 186-195.
20. M. Penn and H. Shasha-Krupnik. Improved approximation algorithms for weighted 2- and 3-vertex connectivity augmentation problems. J. Algorithms, 22:187-196, 1997.
21. S. B. Rao and W. D. Smith. Approximating geometrical graphs via "spanners" and "banyans". STOC 1998, pp. 540-550.
22. M. Stoer. Design of Survivable Networks. Lect. Notes in Math. 1531, Springer-Verlag, 1992.
23. S. Vempala and A. Vetta Factor 4/3 approximations for minimum 2-connected subgraphs. APPROX 2000, pp. 262-273.