Minimum weight 2-edge-connected spanning subgraphs in planar graphs

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

Volumn 4596 LNCS, Issue , 2007, Pages 90-101

  Berger, André ^a   Grigni, Michelangelo ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b EMORY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING;

DIAMETER REDUCTION TECHNIQUE; SPANNING SUBGRAPH;

GRAPH THEORY;

EID: 38149109059     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_10     Document Type: Conference Paper

References (19)

1. Arora, S., Grigni, M., Karger, D., Klein, P., Woloszyn, A.: A polynomial-time approximation scheme for weighted planar graph TSP. In: Proceedings of the Ninth Annual ACM-SIAM SODA, pp. 33-41. ACM Press, New York (1998)
2. Arora, S.: Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In: Proceedings of the Thirtyseventh Annual FOCS, pp. 2-11. IEEE Computer Society Press, Los Alamitos (1996)
3. Berger, A., Czumaj, A., Grigni, M., Zhao, H.: Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs. In: Brodai, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 472-483. Springer, Heidelberg (2005)
4. Berger, A., Grigni, M., Zhao, H.: A well-connected separator for planar graphs. Technical Report TR-2004-026-A, Emory University (2004)
5. Bodlaender, H.L.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25, 1305-1317 (1996)
6. Borradaile, G., Kenyon-Mathieu, C., Klein, P.: A Polynomial-Time Approximation Scheme for Steiner Tree in Planar Graphs. In: Proceedings of the Eighteenth Annual ACM-SIAM SODA, ACM Press, New York (2007)
7. Csaba, B., Karpinski, M., Krysta, P.: Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems. In: Proceedings of the 13th Annual ACM-SIAM Symposium On Discrete Mathematics (SODA), pp. 74-83. ACM Press, New York (2002)
8. Czumaj, A., Grigni, M., Sissokho, P., Zhao, H.: Approximation schemes for minimum 2-edge-connected and biconnected subgraphs in planar graphs. In: Proceedings of the Fifteenth Annual ACM-SIAM SODA, pp. 489-498. ACM Press, New York (2004)
9. Czumaj, A., Lingas, A.: On approximability of the minimumcost k-connected spanning subgraph problem. In: Proceedings of the Tenth Annual ACM-SIAM SODA, pp. 281-290. ACM Press, New York (1999)
10. Demaine, E.D., Hajiaghayi, M.: Fast algorithms for hard graph problems: Bidimensionality, minors, and local treewidth. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 517-533. Springer, Heidelberg (2005)
11. Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. Journal of Graph Algorithms and Applications 3(3), 1-27 (1999)
12. Jothi, R., Raghavachari, B., Varadarajan, S.: A 5/4-approximation algorithm for minimum 2-edge-connectivity. In: Proceedings of the Fourteenth Annual ACM-SIAM SODA, pp. 725-734. ACM Press, New York (2003)
13. Khuller, S.: Approximation algorithms for finding highly connected subgraphs. In: Dorit, S. (ed.) Approximation Algorithms for NP-hard Problems, PWS Publishing, Company (1996)
14. Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. Journal of the ACM 41(2), 214-235 (1994)
15. Klein, P.N.: A linear-time approximation scheme for planar weighted TSP. In: Proceedings of the 46th Annual IEEE FOCS, pp. 647-657. IEEE Computer Society Press, Los Alamitos (2005)
16. Klein, P.N.: A subset spanner for planar graphs, with application to subset TSP. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing (STOC), pp. 749-756. ACM Press, New York (2006)
17. Kloks, T. (ed.): Treewidth. LNCS, vol. 842. Springer, Berlin (1994)
18. Rao, S.B., Smith, W.D.: Approximating geometrical graphs via "spanners" and "banyans". In: Proceedings of the Thirtieth annual ACM Symposium on Theory of Computing (STOC 1998), pp. 540-550. ACM Press, New York (1998)
19. Röhrig, H.: Tree decomposition: A feasibility study. Master's thesis, Max-Planck-Institut für Informatik in Saarbrücken (1998)