Engineering multi-level overlay graphs for shortest-path queries

Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics

Volumn 2006, Issue , 2006, Pages 156-170

  Holzer, Martin ^a   Schulz, Frank ^a   Wagner, Dorothea ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DATABASE SYSTEMS; INDEXING (OF INFORMATION); INFORMATION RETRIEVAL; QUERY LANGUAGES;

MULTI-LEVEL OVERLAY GRAPHS; SELECTION CRITERIA; SHORTESTPATH COMPUTATIONS; VERTEX SELECTION CRITERIA;

GRAPH THEORY;

EID: 33646853341     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972863.15     Document Type: Conference Paper

References (24)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, 1993.
2. B. Bollobás, Random Graphs, London Academic Press, 1985.
3. I. Borgi, J. Graf, M. Holzer, F. Schulz, and T. Willhalm, A graph generator, http://illwww.ira.uka. de/resources/graphgenerator.php.
4. U. Brandes and T. Erlebach, eds., Network Analysis, vol. 3418 of LNCS, Springer, 2005.
5. E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische Mathematik, 1 (1959), pp. 269-271.
6. A. Goldberg and C. Harrelson, Computing the shortest path: A* search meets graph theory, in Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), SIAM, 2005.
7. A. Goldberg, H. Kaplan, and R. Werneck, Reach for A*: Efficient point-to-point shortest path algorithms, in Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX06), SIAM, 2006. To appear in the same volume.
8. R. Gutman, Reach-based routing: A new approach to shortest path algorithms optimized for road networks, in Proceedings 6th Workshop on Algorithm Engineering and Experiments (ALENEX), SIAM, 2004, pp. 100-111.
9. M. Holzer, Hierarchical speed-up techniques for shortest-path algorithms, Master's thesis, Universität Konstanz, Fachbereich Informatik und Informations-wissenschaft, 2003. http://www.ub.uni-konstanz. de/kops/volltexte/2003/1038/.
10. M. Holzer, G. Prasinos, F. Schulz, D. Wagner, and C. Zaroliagis, Engineering planar separator algorithms, in Proceedings 13th European Symposium on Algorithms (ESA), vol. 3669 of LNCS, Springer, 2005, pp. 628-639.
11. M. Holzer, F. Schulz, and T. Willhalm, Combining speed-up techniques for shortest-path computations, in Proceedings Third International Workshop on Experimental and Efficient Algorithms (WEA 2004), vol. 3059 of LNCS, Springer, 2004, pp. 269-284.
12. N. Jing, Y.-W. Huang, and E. A. Rundensteiner, Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation, IEEE Trans. Knowledge and Data Engineering, 10 (1998).
13. S. Jung and S. Pramanik, An efficient path computation model for hierarchically structured topographical road maps, IEEE Trans. Knowledge and Data Engineering, 14 (2002).
14. G. Karypis, MeTiS. http://vwv-users.cs.umn.edu/~karypis/metis.
15. U. Lauther, An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background, in Geoinformation und Mobilität - von der Forschung zur praktischen Anwendung, vol. 22, IfGI prints, Institut für Geoinformatik, Münster, 2004, pp. 219-230.
16. R. H. Möhring, H. Schilling, B. Schütz, D. Wagner, and T. Willhalm, Partitioning graphs to speed up Dijkstra's algorithm., in WEA, S. E. Nikoletseas, ed., vol. 3503 of Lecture Notes in Computer Science, Springer, 2005, pp. 189-202.
17. S. Näher and K. Mehlhorn, The LEDA Platform of Combinatorial and Geometric Computing, Cambridge University Press, 1999. (http;//www.algorithmic- solutions.com).
18. P. Sanders and D. Schultes, Highway hierarchies hasten exact shortest path queries, in Proceedings 17th European Symposium on Algorithms (ESA), 2005.
19. F. Schulz, Timetable Information and Shortest Paths, PhD thesis, Universität Karlsruhe (TH), Fakultät Informatik, 2005.
20. F. Schulz, D. Wagner, and K. Weihe, Dijkstra's algorithm on-line: An empirical case study from public railroad transport, J. Experimental Algorithmics, 5 (2000).
21. F. Schulz, D. Wagner, and C. Zaroliagis, Using multi-level graphs for timetable information in railway systems, in Proceedings 4th Workshop on Algorithm Engineering and Experiments (ALENEX), vol. 2409 of LNCS, Springer, 2002, pp. 43-59.
22. D. Wagner and T. Willhalm, Geometric speed-up techniques for finding shortest paths in large sparse graphs, in Proc. 11th European Symposium on Algorithms (ESA), vol. 2832 of LNCS, Springer, 2003, pp. 776-787.
23. T. Willhalm, Engineering Shortest Paths and Layout Algorithms for Large Graphs, PhD thesis, Universität Karlsruhe (TH), Fakultät Informatik, 2005.
24. T. Willhalm and D. Wagner, Shortest path speedup techniques, in Algorithmic Methods for Railway Optimization, LNCS, Springer, 2006. To appear, see also [23].