Steiner tree in planar graphs: An O(n log n) approximation scheme with singly-exponential dependence on epsilon

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

Volumn 4619 LNCS, Issue , 2007, Pages 275-286

  Borradaile, Glencora ^a   Klein, Philip N ^a   Mathieu, Claire ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC STABILITY; GRAPH THEORY;

PLANAR GRAPHS; STEINER TREE;

ALGORITHMS;

EID: 38149006341     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73951-7_25     Document Type: Conference Paper

References (26)

1. Arora, S.: Polynomial-time approximation schemes for euclidean TSP and other geometric problems. JACM 45(5), 753-782 (1998)
2. Berman, P., Ramaiyer, V.: Improved approximations for the Steiner tree problem. Journal of Algorithms 17, 381-408 (1994)
3. Bern, M.: Faster exact algorithms for Steiner trees in planar networks. Networks 20, 109-120 (1990)
4. Bern, M., Bienstock, D.: Polynomially solvable special cases of the Steiner problem in planar networks. Annals of Operations Research 33, 405-418 (1991)
5. Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. IPL 32, 171-176 (1989)
6. 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)
7. Erickson, R., Monma, C., Veinott, A.: Send-and-split method for minimum-concave-cost network flows. Mathematics of Operations Research 12, 634-664 (1987)
8. Garey, M., Johnson, D.: The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math. 32(4), 826-834 (1977)
9. Henzinger, M., Klein, P., Rao, S., Subramanian, S.: Faster shortest-path algorithms for planar graphs. J. Comput. System Sci. 55(1), 3-23 (1997)
10. Hougardy, S., Prömel, H.J.: A 1.598 approximation algorithm for the Steiner problem in graphs. In: 10th SODA, pp. 448-453 (1999)
11. Karp, R.: On the computational complexity of combinatorial problems. Networks 5, 45-68 (1975)
12. Karpinski, M., Zelikovsky, A.: New approximation algorithms for the Steiner tree problem. Journal of Combinatorial Optimization 1, 47-65 (1997)
13. Klein, P.: A linear-time approximation scheme for planar weighted TSP. In: 46th FOCS, p. 647 (2005)
14. Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Informatica 15, 141-145 (1981)
15. Mehlhorn, K.: Approximation algorithm for the Steiner problem in graphs. IPL 27(3), 125-128 (1988)
16. Mitchell, J.: Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric tsp, k-mst, and related problems. SIAM J. Comput. 28(4), 1298-1309 (1999)
17. Promel, H.J., Steger, A.: RNC approximation algorithms for the Steiner problem. In: 39th STOC. LNCS, vol. 1200, pp. 559-570. Springer, Heidelberg (1997)
18. Provan, J.: An approximation scheme for finding Steiner trees with obstacles. SIAM J. Comput. 17, 920-934 (1988)
19. Provan, J.: Convexity and the Steiner tree problem. Networks 18, 55-72 (1988)
20. Rao, S., Smith, W.: Approximating geometrical graphs via spanners and banyans. In: 30th STOC, pp. 540-550 (1998)
21. Robins, G., Zelikovsky, A.: Tighter bounds for graph Steiner tree approximation. SIAM J. Discret. Math. 19(1), 122-134 (2005)
22. Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Mathematica Japonicae 24, 571-577 (1980)
23. Widmayer, P.: A fast approximation algorithm for Steiner's problem in graphs. In: Tinhofer, G., Schmidt, G. (eds.) WG 1986. LNCS, vol. 246, pp. 17-28. Springer, Heidelberg (1987)
24. Wu, Y., Widmayer, P., Wong, C.: A faster approximation algorithm for the Steiner problem in graphs. Acta informatica 23(2), 223-229 (1986)
25. Zelikovsky, A.: Better approximation bounds for the network and Euclidean Steiner tree problems. Technical Report CS-96-06, University of Virginia (1994)
26. Zelikovsky, A.: An 11/6-approximation algorithm for the network Steiner problem. Algorithmica 9, 463-470 (1999)