Approximation Schemes for Minimum 2-Edge-Connected and Biconnected Subgraphs in Planar Graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 489-498

  Czumaj, Artur ^a   Grigni, Michelangelo ^b   Sissokho, Papa ^c   Zhao, Hairong ^a  

^a University Heights   (United States)

^b EMORY UNIVERSITY   (United States)

^c ILLINOIS STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; THEOREM PROVING;

BICONNECTED SUBGRAPHS; PLANAR GRAPHS; SPANNING SUBGRAPHS;

GRAPH THEORY;

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

References (17)

1. I. Althöfer, G. Das, D. P. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete Comput. Geom., 9(1):81-100, 1993. An early version appeared in SWAT'90, LNCS V. 447.
2. I. Althöfer, G. Das, D. P. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete Comput. Geom., 9(1):81-100, 1993. An early version appeared in SWAT'90, LNCS V. 447.
3. S. Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. Journal of the ACM, 45(5): 753-782, 1998.
4. S. Arora, M. Grigni, D. Karger, P. Klein, and A. Woloszyn. A polynomial time approximation scheme for weighted planar graph TSR Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 33-41, 1998.
5. J. Cheriyan, A. Sebö, and Z. Szigeti. An improved approximation algorithm for minimum size 2-edge connected spanning subgraphs. Proc. 6th IPCO, LNCS, 1412:126-136, 1998.
6. J. Cheriyan, S. Vempala, and A. Vetta. Approximation algorithms for minimum-cost k-vertex connected subgraphs. Proc. 34th ACM Symposium on Theory of Computing, pages 306-312, 2002.
7. B. Csaba, M. Karpinski, and P. Krysta. Approximability of dense sparse instances of minimum 2-connectivity, TSP and path problems. Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 74-83, 2002.
8. A. Czumaj and A. Lingas. On approximability of the minimum cost spanning subgraph problem. Proc. 10th Annual A CM-SIAM Symposium on Discrete Algorithms, pages 281-290, 1999.
9. A. Czumaj and A. Lingas. Fast approximation schemes for Euclidean minimum-cost multi-connectivity. Proc. 27th Annual Intl. Colloq. on Automata, Languages, and Programming (ICALP), LNCS, 1853:856-868, 2000.
10. R. Diestel. Graph theory. Springer-Verlag, New York, 2000.
11. C. G. Fernandas. A better approximation ratio for the minimum size k-edge-connected spanning subgraph problem. Journal of Algorithms, 28:105-124, 1988.
12. R. Jothi, B. Raghavachari, and S. Varadarajan. A 5/4-approximation algorithm for minimum 2-edge-connectivity. Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 725-734, 2003.
13. M. Grigni, B. Koutsoupias, and C. Papadimitriou. An approximation scheme for planar graph TSP. Proc. 36th IEEE Symposium on Foundations of Computer Science, pages 640-645, 1995.
14. M. Grigni and P. Sissokho. Light spanners and approximate TSP in weighted graphs with forbidden minors. Proc 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 852-857, 2002.
15. R. Lipton and R. Tarjan. Applications of a planar separator theorem. SIAM Journal on Computing, 9(3):615-627, 1980.
16. G. L. Miller. Finding small simple cycle separators for 2-connected planar graphs. Journal of Computer and System Sciences, 32:265-279, 1986.
17. S. Vempala and A. Vetta. Factor 4/3-approximations for minimum 2-connected subgraphs. Proc. 3rd Work-shop APPROX, LNCS, 1913:262-273, 2000.