The two-edge connectivity survivable network problem in planar graphs

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

Volumn 5125 LNCS, Issue PART 1, 2008, Pages 485-501

  Borradaile, Glencora ^a   Klein, Philip ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EDGE CONNECTIVITIES; EDGE-DISJOINT PATHS; EDGE-WEIGHTS; PLANAR GRAPHS; STEINER TREE PROBLEM; SUB GRAPHS; SURVIVABLE NETWORKS; TELECOMMUNICATIONS APPLICATIONS;

GRAPH THEORY; LINGUISTICS; TELECOMMUNICATION SYSTEMS; TRANSLATION (LANGUAGES);

TREES (MATHEMATICS);

EID: 49049084452     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70575-8_40     Document Type: Conference Paper

References (20)

1. Baker, B.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153-180 (1994)
2. Berger, A., Czumaj, A., Grigni, M., Zhao, H.: Approximation schemes for minimum 2-connected spanning subgraphs in weighted planar graphs. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 472-483. Springer, Heidelberg (2005)
3. Berger, A., Grigni, M.: Minimum weight 2-edge-connected spanning subgraphs in planar graphs. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 90-101. Springer, Heidelberg (2007)
4. Borradaile, G., Kenyon-Mathieu, C., Klein, P.: A polynomial-time approximation scheme for Steiner tree in planar graphs. In: 18th SODA, pp. 1285-1294 (2007)
5. Borradaile, G., Klein, P., Mathieu, C.: Steiner tree in planar graphs: An O(n log n) approximation scheme with singly exponential dependence on epsilon. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 275-286. Springer, Heidelberg (2007)
6. Czumaj, A., Lingas, A.: On approximability of the minimum cost k-connected spanning subgraph problem. In: 10th SODA, pp. 281-290 (1999)
7. Erickson, R., Monma, C., Veinott, A.: Send-and-split method for minimum-concave-cost network flows. Math. Op. Res. 12, 634-664 (1987)
8. Eswaran, K., Tarjan, R.: Augmentation problems. SIAM J. Comput. 5(4), 653-665 (1976)
9. Frederickson, G., Jájá, J.: Approximation algorithms for several graph augmentation problems. SIAM J. Comput. 10(2), 270-283 (1981)
10. Goemans, M., Goldberg, A., Plotkin, S., Shmoys, D., Tardos, É., Williamson, D.: Improved approximation algorithms for network design problems. In: 5th SODA, pp. 223-232 (1994)
11. Henzinger, M., Klein, P., Rao, S., Subramanian, S.: Faster shortest-path algorithms for planar graphs. J. Comput. System Sci. 55(1), 3-23 (1997)
12. Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21(1), 39-60 (2001)
13. Jothi, R., Raghavachari, B., Varadarajan, S.: A 5/4-approximation algorithm for minimum 2-edge-connectivity. In: 14th SODA, pp. 725-734 (2003)
14. Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. J. ACM 41(2), 214-235 (1994)
15. Klein, P.: A linear-time approximation scheme for planar weighted TSP. In: 46th FOCS, pp. 647-647 (2005)
16. Klein, P.: A subset spanner for planar graphs, with application to subset TSP. In: 38th STOC, pp. 749-756 (2006)
17. Klein, P., Ravi, R.: When cycles collapse: A general approximation technique for constraind two-connectivity problems. In: 3rd IPCO, pp. 39-55 (1993)
18. Ravi, R.: Approximation algorithms for Steiner augmentations for two-connectivity. Technical Report TR-CS-92-21, Brown University (1992)
19. Resende, M., Pardalos, P. (eds.): Handbook of Optimization in Telecommunications. Springer, Heidelberg (2006)
20. Williamson, D., Goemans, M., Mihail, M., Vazirani, V.: A primal-dual approximation algorithm for generalized Steiner network problems. In: 35th STOC, pp. 708-717 (1993)