Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation

Discrete Applied Mathematics

Volumn 157, Issue 4, 2009, Pages 673-684

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

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

Mehlhorn's algorithm; Minor closed graph classes; Planar graph; Shortest path; Steiner tree

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; FOURIER TRANSFORMS; GRAPH THEORY; PROGRAMMING THEORY; WIRELESS SENSOR NETWORKS;

MEHLHORN'S ALGORITHM; MINOR-CLOSED GRAPH CLASSES; PLANAR GRAPH; SHORTEST PATH; STEINER TREE;

TREES (MATHEMATICS);

EID: 59749102167     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.08.002     Document Type: Article

References (28)

1. Dijkstra E. A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959) 269-271
2. Fredman M.L., and Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM 34 3 (1987) 596-615
3. Pettie S., and Ramachandran V. A shortest path algorithm for real-weighted undirected graphs. SIAM Journal on Computing 34 6 (2005) 1398-1431
4. Goldberg A.V. A simple shortest path algorithm with linear average time. ESA'01: Proceedings of the 9th Annual European Symposium on Algorithms. Lecture Notes in Computer Science vol. 2161 (2001), Springer-Verlag, London, UK 230-241
5. Thorup M. Undirected single-source shortest paths with positive integer weights in linear time. Journal of the ACM 46 3 (1999) 362-394
6. Hagerup T. Improved shortest paths on the word RAM. In: Montanari U., Rolim J.D.P., and Welzl E. (Eds). ICALP. Lecture Notes in Computer Science vol. 1853 (2000), Springer 61-72
7. Zwick U. Exact and approximate distances in graphs - A survey. ESA'01: Proceedings of the 9th Annual European Symposium on Algorithms. Lecture Notes in Computer Science vol. 2161 (2001), Springer-Verlag, London, UK 33-48
8. Henzinger M.R., Klein P.N., Rao S., and Subramanian S. Faster shortest-path algorithms for planar graphs. Journal of Computer and System Sciences 55 1 (1997) 3-23 Previously appeared in the Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, STOC'94, ACM Press, pp. 27-37
9. Frederickson G.N. Data structures for on-line updating of minimum spanning trees, with applications. SIAM Journal on Computing 14 4 (1985) 781-798
10. Frederickson G.N. Fast algorithms for shortest paths in planar graphs, with applications. SIAM Journal on Computing 16 6 (1987) 1004-1022
11. Lipton R.J., and Tarjan R.E. A separator theorem for planar graphs. SIAM Journal on Applied Mathematics 36 2 (1979) 177-189
12. Reed B., and Wood D.R. Fast separation in a graph with an excluded minor. In: Felsner S. (Ed). 2005 European Conference on Combinatorics, Graph Theory and Applications, EuroComb'05. DMTCS Proceedings, Discrete Mathematics and Theoretical Computer Science vol. AE (2005) 45-50
13. Alon N., Seymour P., and Thomas R. A separator theorem for nonplanar graphs. Journal of the American Mathematical Society 3 4 (1990) 801-808
14. Karp R.M. Reducibility among combinatorial problems. In: Miller R.E., and Thatcher J.W. (Eds). Complexity of Computer Computations (1972), Plenum Press 85-103
15. Bern M., and Plassmann P. The Steiner problem with edge lengths 1 and 2. Information Processing Letters 32 4 (1989) 171-176
16. Chlebík M., and Chlebíková J. Approximation hardness of the Steiner tree problem on graphs. In: Penttonen M., and Schmidt E.M. (Eds). SWAT. Lecture Notes in Computer Science vol. 2368 (2002), Springer 170-179
17. G. Robins, A. Zelikovsky, Improved Steiner tree approximation in graphs, in: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 770-779
18. Choukhmane E.-A. Une heuristique pour le problème de l'arbre de Steiner. Recherche Opèrationelle. 12 (1978) 207-212
19. Plesnik J. A bound for the Steiner problem in graphs. Mathematica Slovaca 31 (1981) 155-163
20. Mehlhorn K. A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters 27 (1988) 125-128
21. Garey M., and Johnson D. The rectilinear Steiner tree problem is N P-complete. SIAM Journal on Applied Mathematics 32 (1977) 826-834
22. G. Borradaile, C. Kenyon-Mathieu, P.N. Klein, A polynomial-time approximation scheme for Steiner tree in planar graphs, in: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 1285-1294
23. Borradaile G., Kenyon-Mathieu C., and Klein P.N. Steiner tree in planar graphs: An O (n log n) approximation scheme with singly exponential dependence on epsilon. Proceedings of the 10th Workshop on Algorithms and Data Structures. Lecture Notes in Computer Science vol. 4619 (2007), Springer 275-286
24. Mares M. Two linear time algorithms for MST on minor closed graph classes. Archivum Mathematicum 40 3 (2004) 315-320
25. Cheriton D.R., and Tarjan R.E. Finding minimum spanning trees. SIAM Journal on Computing 5 4 (1976) 724-742
26. Robertson N., and Seymour P.D. Graph minors. XX. Wagner's conjecture. Journal of Combinatorial Theory Series B 92 2 (2004) 325-357
27. Mader W. Homomorphieeigenschaften und mittlere Kantendichte von Graphen. Mathematische Annalen 174 (1967) 265-268
28. Robertson N., and Seymour P. Graph minors. XVI. Excluding a non-planar graph. Journal of Combinatorial Theory Series B 89 1 (2003) 43-76