Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2010, Pages 211-220

  Bateni, MohammadHossein ^a   Hajiaghayi, MohammadTaghi ^b,d   Marx, Dániel ^c  

^a Princeton University   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c TEL AVIV UNIVERSITY   (Israel)

^d University of Maryland ^*  (United States)

Author keywords

bounded genus graphs; bounded treewidth graphs; planar graphs; PTAS; series parallel graphs; Steiner forest

Indexed keywords

APPROXIMATION SCHEME; BOUNDED TREEWIDTH; BUILDING BLOCKES; CLUSTERING PROCEDURE; MINIMUM CUT; NP-HARD; PLANAR GRAPH; POLYNOMIAL TIME APPROXIMATION SCHEMES; POLYNOMIAL-TIME; PRIZE-COLLECTING; SERIES-PARALLEL GRAPH; STEINER FOREST PROBLEM; STEINER FORESTS; STEINER TREES; TREE DECOMPOSITION; TREE-WIDTH;

COMPUTATION THEORY; DYNAMIC PROGRAMMING; GRAPH THEORY; PARALLEL PROGRAMMING; POLYNOMIAL APPROXIMATION;

GRAPHIC METHODS;

EID: 77954751021     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1806689.1806720     Document Type: Conference Paper

References (32)

1. A. Agrawal, P. Klein, and R. Ravi. When trees collide: an approximation algorithm for the generalized Steiner problem on networks. SIAM J. Comput., 24(3):440-456, 1995.
2. A. Agrawal, P. N. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized Steiner problem on networks. In STOC, pages 134-144, 1991.
3. A. Archer, M. Bateni, M. Hajiaghayi, and H. Karloff. Improved approximation algorithms for prize-collecting Steiner tree and TSP. In FOCS, 2009.
4. S. Arora. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. In FOCS, page 2, 1996.
5. S. Arora. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM, 45(5):753-782, 1998. (Pubitemid 128497506)
6. M. Bateni, M. Hajiaghayi, and D. Marx. Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth. CoRR, abs/0911.5143, 2009.
7. P. Berman and V. Ramaiyer. Improved approximations for the Steiner tree problem. In SODA, pages 325-334, 1992.
8. M. Bern and P. Plassmann. The Steiner problem with edge lengths 1 and 2. Information Processing Letters, 32:171-176, 1989.
9. H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209(1-2):1-45, 1998.
10. G. Borradaile, E. D. Demaine, and S. Tazari. Polynomial-time approximation schemes for subset-connectivity problems in bounded genus graphs. In STACS, pages 171-182, 2009.
11. G. Borradaile, P. N. Klein, and C. Mathieu. A polynomial-time approximation scheme for Euclidean Steiner forest. In FOCS, pages 115-124, 2008.
12. G. Borradaile, C. Mathieu, and P. N. Klein. A polynomial-time approximation scheme for Steiner tree in planar graphs. In SODA, pages 1285-1294, 2007.
13. E. D. Demaine, M. Hajiaghayi, and B. Mohar. Approximation algorithms via contraction decomposition. In SODA, pages 278-287, 2007.
14. R. Diestel. Graph Theory (Graduate Texts in Mathematics). Springer, August 2005.
15. M. R. Garey and D. S. Johnson. The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math., 32(4):826-834, 1977.
16. E. Gassner. The Steiner forest problem revisited. J. Disc. Alg., In Press, Corrected Proof, 2009.
17. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM J. Comput., 24(2):296-317, 1995.
18. S. Hougardy and H. J. Prömel. A 1.598 approximation algorithm for the Steiner problem in graphs. In Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms (SODA), pages 448-453, 1999.
19. R. M. Karp. On the computational complexity of combinatorial problems. Networks, 5:45-68, 1975.
20. M. Karpinski and A. Zelikovsky. New approximation algorithms for the Steiner tree problems. J. Comb. Opt., 1(1):47-65, 1997.
21. P. N. Klein. A linear-time approximation scheme for TSP in undirected planar graphs with edge-weights. SIAM J. Comput., 37(6):1926-1952, 2008.
22. D. Marx. NP-completeness of list coloring and precoloring extension on the edges of planar graphs. J. Graph Theory, 49(4):313-324, 2005.
23. D. Marx. Complexity results for minimum sum edge coloring. Discrete Applied Mathematics, 157(5):1034-1045, 2009.
24. J. S. B. Mitchell. Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM Journal on Computing, 28(4):1298-1309, 1999.
25. H. J. Prömel and A. Steger. RNC-approximation algorithms for the Steiner problem. In Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pages 559-570, 1997.
26. M. B. Richey and R. G. Parker. On multiple Steiner subgraph problems. Networks, 16(4):423-438, 1986.
27. G. Robins and A. Zelikovsky. Tighter bounds for graph Steiner tree approximation. SIAM J. Disc. Math., 19(1):122-134, 2005.
28. M. Thimm. On the approximability of the Steiner tree problem. Theor. Comput. Sci., 295(1-3):387-402, 2003.
29. A. Zelikovsky. An 11/6-approximation for the Steiner problem on graphs. In Fourth Czechoslovakian Symp. Combinatorics, Graphs, and Complexity (1990) in Annals of Discrete Mathematics, volume 51, pages 351-354, 1992.
30. A. Zelikovsky. An 11/6-approximation algorithm for the network Steiner problem. Algorithmica, 9(5):463-470, 1993.
31. A. Zelikovsky. Better approximation bounds for the network and Euclidean Steiner tree problems. Technical report, University of Virginia, Charlottesville, VA, USA, 1996.
32. X. Zhou and T. Nishizeki. The edge-disjoint paths problem is NP-complete for partial k-trees. In Algorithms and computation (Taejon, 1998), pages 417-426. Springer, Berlin, 1998.