Dealing with large hidden constants: Engineering a planar Steiner tree PTAS

2009 Proceedings of the 11th Workshop on Algorithm Engineering and Experiments, ALENEX 2009

Volumn , Issue , 2009, Pages 120-131

  Tazari, Siamak ^a   Müller Hannemann, Matthias ^b  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTATION THEORY; POLYNOMIAL APPROXIMATION;

APPROXIMATION RATIOS; CHOICE OF PARAMETERS; COMPUTATIONAL EXPERIMENT; ORIGINAL ALGORITHMS; POLYNOMIAL TIME APPROXIMATION SCHEMES; PROCESSING POWER; STEINER TREES; THEORY AND PRACTICE;

TREES (MATHEMATICS);

EID: 77955861285     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972894.12     Document Type: Conference Paper

References (40)

1. Karp, R.M.: Reducibility among combinatorial problems. In Miller, R.E., Thatcher, J.W., eds.: Complexity of Computer Computations. Plenum Press (1972) 85-103.
2. Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. Information Processing Letters 32 (1989) 171-176.
3. Chlebik, M., Chlebikova, J.: Approximation hardness of the Steiner tree problem on graphs. In Penttonen, M., Schmidt, E.M., eds.: SWAT. Volume 2368 of Lecture Notes in Computer Science., Springer (2002) 170-179.
4. Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms. (2000) 770-779.
5. Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1 (1972) 195-208.
6. Erickson, R.E., Monma, C.L., Arthur F., Veinott, J.: Send-and-split method for minimum-concave-cost network flows. Math. Oper. Res. 12 (1987) 634-664.
7. Bjorklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets m̈obius: fast subset convolution. In: STOC '07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, New York, NY, USA, ACM (2007) 67-74.
8. Choukhmane, E.A.: Une heuristique pour le probl̀eme de l'arbre de Steiner. Rech. Oper. 12 (1978) 207-212.
9. Plesnik, J.: A bound for the Steiner problem in graphs. Math. Slovaca 31 (1981) 155-163.
10. Mehlhorn, K.: A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters 27 (1988) 125-128.
11. Tazari, S., Muller-Hannemann, M.: Shortest paths in linear time on minor-closed graph classes with an application to Steiner tree approximation. Discrete Applied Mathematics (2008, in press). An extended abstract appeared in WG '08: Proceedings of the 34th Workshop on Graph Theoretic Concepts in Computer Science, LNCS 5344, pp. 360-371, Springer, 2008.
12. Garey, M., Johnson, D.: The rectilinear Steiner tree problem is NP-complete. SIAM Journal on Applied Mathematics 32 (1977) 826-834.
13. Borradaile, G., Mathieu, C., Klein, P.N.: A polynomial-time approximation scheme for Steiner tree in planar graphs. In: SODA '07: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms. (2007) 1285-1294.
14. Borradaile, G., Mathieu, C., Klein, P.N.: Steiner tree in planar graphs: An O(n log n) approximation scheme with singly exponential dependence on epsilon. In: WADS '07: Proceedings of the 10th Workshop on Algorithms and Data Structures. Volume 4619 of Lecture Notes in Computer Science., Springer (2007) 275-286.
15. Arora, S., Grigni, M., Karger, D., Klein, P., Woloszyn, A.: A polynomial-time approximation scheme for weighted planar graph TSP. In: SODA '98: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA (1998) 33-41.
16. Arora, S.: Approximation schemes for NP-hard geometric optimization problems: A survey. Mathematical Programming 97 (2003) 43-69.
17. Klein, P.N.: A linear-time approximation scheme for TSP for planar weighted graphs. In: FOCS '05: Proceedings of the 46th IEEE Symposium on Foundations of Computer Science. (2005) 146-155.
18. Demaine, E.D., Hajiaghayi, M.T.: Bidimensionality: New connections between FPT algorithms and PTASs. In: SODA '05: Proceedings of the 16th Annual ACMSIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA (2005) 590-601.
19. Klein, P.N.: A subset spanner for planar graphs, with application to subset TSP. In: STOC '06: Proceedings of the 38th ACM Symposium on Theory of Computing. (2006) 749-756.
20. Zachariasen, M., Winter, P.: Obstacle-avoiding Euclidean Steiner trees in the plane: An exact approach. In: Workshop on Algorithm Engineering and Experimentation. Volume 1619 of Lecture Notes in Computer Science., Springer (1999) 282-295.
21. Koch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks 33 (1998) 207-232.
22. Polzin, T., Daneshmand, S.V.: Improved algorithms for the steiner problem in networks. Discrete Appl. Math. 112 (2001) 263-300.
23. Polzin, T., Daneshmand, S.V.: Extending reduction techniques for the steiner tree problem. In: ESA '02: Proceedings of the 10th Annual European Symposium on Algorithms, London, UK, Springer-Verlag (2002) 795-807.
24. Polzin, T., Daneshmand, S.V.: Practical partitioningbased methods for the Steiner problem. In: WEA '06: Proceedings of the 5th International Workshop on Experimental Algorithms. Volume 4007 of Lecture Notes in Computer Science., Cala Galdana, Menorca, Spain (2006) 241-252.
25. Kahng, A., Robins, G.: A new class of iterative Steiner tree heuristics with good performance. IEEE Trans. on CAD 11 (1992) 1462-1465.
26. Griffith, J., Robins, G., Salowe, J.S., Zhang, T.: Closing the gap: Near-optimal Steiner trees in polynomial time. IEEE Trans. Computer-Aided Design 13 (1994) 1351-1365.
27. Poggi de Aragao, M., Werneck, R.F.: On the implementation of MST-based heuristics for the Steiner problem in graphs. In: ALENEX '02: Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments, London, UK, Springer- Verlag (2002) 1-15.
28. Kahng, A., Mandoiu, I., Zelikovsky, A.: Highly scalable algorithms for rectilinear and octilinear Steiner trees. Proceedings 2003 Asia and South Pacific Design Automation Conference (ASP-DAC) (2003) 827-833.
29. Borradaile, G., Klein, P.: The two-edge connectivity survivable network problem in planar graphs. In: ICALP '08: Proceedings of the 35th International Colloquium on Automata, Languages and Programming. Volume 5125 of Lecture Notes in Computer Science., Springer (2008) 485-501.
30. Borradaile, G., Demaine, E.D., Tazari, S.: Polynomialtime approximation schemes for subset-connectivity problems in bounded-genus graphs. In: STACS '09: Proceedings of the 26th Symposium on Theoretical Aspects of Computer Science. (2009) to appear.
31. Baker, B.S.: Approximation algorithms for NP- complete problems on planar graphs. J. ACM 41 (1994) 153-180.
32. Bodlaender, H.L., Koster, A.M.C.A.: Combinatorial optimization on graphs of bounded treewidth. The Computer Journal 51 (2008) 255-269.
33. Alber, J., Dorn, F., Niedermeier, R.: Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs. Discrete Applied Mathematics 145 (2005) 219-231.
34. Koster, A.M.C.A., van Hoesel, C.P.M., Kolen, A.W.J.: Solving partial constraint satisfaction problems with tree decomposition. Networks 40 (2002) 170-180.
35. Hicks, I.V., Koster, A.M.C.A., Kolotoglu, E.: Branch and tree decomposition techniques for discrete optimization. In Smith, J.C., ed.: TutORials 2005. INFORMS TutORials in Operations Research Series. INFORMS Annual Meeting (2005) 1-29.
36. Koch, T., Martin, A., Voß, S.: SteinLib: An updated library on steiner tree problems in graphs. Technical Report ZIB-Report 00-37, Konrad-Zuse-Zentrum fur Informationstechnik Berlin, Takustr. 7, Berlin (2000) http://elib.zib.de/steinlib.
37. Tarjan, R.E., Werneck, R.F.: Self-adjusting top trees. In: SODA '05: Proceedings of the 16th Annual ACMSIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics (2005) 813-822.
38. Klein, P.N.: Multiple-source shortest paths in planar graphs. In: SODA '05: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, Philadelphia, PA, USA (2005) 146-155.
39. Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959) 269- 271.
40. OGDF - Open Graph Drawing Framework. University of Dortmund, Chair of Algorithm Engineering and System Analysis. www.ogdf.net.