Combining speed-up techniques for shortest-path computations

ACM Journal of Experimental Algorithmics

Volumn 10, Issue , 2005, Pages

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

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Algorithms; Combination; Design; Dijkstra's algorithm; Experimentation; G.2.2 discrete mathematics : Graph theory; Shortest path; Speed up

Indexed keywords

EID: 49749130936     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1064546.1180616     Document Type: Article

References (38)

1. AHUJA, R., MAGNANTI, T., AND ORLIN, J. 1993. Network flows. Prentice-Hall, Englewood Cliffs, NJ.
2. BARRETT, C., JACOB, R., AND MARATHE, M. 2000. Formal-language-constrained path problems. SIAM Journal on Computing 30, 3, 809-837.
3. th European Symposium on Algorithms (ESA). LNCS, vol. 2461. Springer-Verlag, New York. 126-128.
4. CHERKASSKY, B. V., GOLDBERG, A. V., AND RADZIK, T. 1996. Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming 73, 129-174.
5. DIAL, R. 1969. Algorithm 360: Shortest path forest with topological ordering. Communications of ACM 12, 632-633.
6. DIJKSTRA, E. W. 1959. A note on two problems in connexion with graphs. Numerische Mathematik 1, 269-271.
7. FLINSENBERG, I. C. 2004. Route Planning Algorithms for Car Navigation. Ph.D. thesis, Technische Universiteit Eindhoven.
8. FREDMAN, M. L. AND TARJAN, R. E. 1987. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM 34, 3, 596-615.
9. th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005). SIAM.
10. th Workshop on Algorithm Engineering and Experiments (ALENEX 06). SIAM. 129-143.
11. GOLDBERG, A. V. 2001a. Shortest path algorithms: Engineering aspects. In Proc. International Symposium on Algorithms and Computation (ISAAC), LNCS, vol. 2223. Springer-Verlag, New York. 502-513.
12. th European Symposium on Algorithms (ESA), LNCS, vol. 2161. Springer-Verlag, New York. 230-241.
13. th Workshop on Algorithm Engineering and Experiments (ALENEX), SIAM, 100-111.
14. HART, P., NILSSON, N. J., AND RAPHAEL, B. A. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Sys. Sci. Cybernet. 2.
15. HOLZER, M. 2003. Hierarchical speed-up techniques for shortest-path algorithms. Tech. rep., Dept. of Informatics, University of Konstanz, Germany. http://www.ub.uni-konstanz.de/kops/volltexte/2003/1038/.
16. th Workshop on Algorithm Engineering and Experiments (ALENEX 06). SIAM. 156-170.
17. JING, N., HUANG, Y.-W., AND RUNDENSTEINER, E. A. 1998. Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE Trans. Knowledge and Data Engineering 10, 3.
18. JUNG, S. AND PRAMANIK, S. 2002. An efficient path computation model for hierarchically structured topographical road maps. IEEE Transactions on Knowledge and Data Engineering 14, 5, 1029-1046.
19. KAINDL, H. AND KAINZ, G. 1997. Bidirectional heuristic search reconsidered. Journal of Artificial Intelligence Research 7, 283-317.
20. KÖHLER, E., MÖHRING, R. H., AND SCHILLING, H. 2004. Acceleration of shortest path computation. Article 42, Technische Universität Berlin, Fakultät II Mathematik und Naturwissenschaften.
21. LAUTHER, U. 2004. 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, 219-230.
22. th Symp. on Discrete Algorithms. 797-806.
23. NACHTIGALL, K. 1995. Time depending shortest-path problems with applications to railway networks. European Journal of Operational Research 83, 1, 154-166.
24. NÄHER, S. AND MEHLHORN, K. 1999. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press. (http://www.algorithmic-solutions.com).
25. PETTIE, S., RAMACHANDRAN, V., AND SRIDHAR, S. 2002. Experimental evaluation of a new shortest path algorithm. In Proc. Algorithm Engineering and Experiments (ALENEX), LNCS, vol. 2409. Springer-Verlag, New York. 124-142.
26. POHL, I. 1969. Bi-directional and heuristic search in path problems. Techical Report 104, Stanford Linear Accelerator Center, Stanford, CA.
27. th Int. Conf. Appl. Computer Networking in Architecture, Construction, Design, Civil Eng., and Urban Planning (europIA '97).
28. th European Symposium on Algorithms (ESA).
29. SCHULZ, F., WAGNER, D., AND WEIHE, K. 2000. Dijkstra's algorithm on-line: An empirical case study from public railroad transport. ACM Journal of Exp. Algorithmics 5, 12.
30. th Workshop on Algorithm Engineering and Experiments (ALENEX). LNCS, vol. 2409. Springer-Verlag, New York. 43-59.
31. SHEKHAR, S., FETTERER, A., AND GOYAL, B. 1997. Materialization trade-offs in hierarchical shortest path algorithms. In Proc. Symp. on Large Spatial Databases. 94-111.
32. th IEEE Int. Conf. Data Eng. 31-39.
33. th European Symposium on Algorithms (ESA), LNCS, vol. 2832. Springer-Verlag, New York. 776-787.
34. WAXMAN, B. M. 1988. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications 6, 9.
35. WILLHALM, T. 2005. Engineering Shortest Paths and Layout Algorithms for Large Graphs. Ph.D. thesis, Universität Karlsruhe (TH), Fakultät Informatik.
36. WILLHALM, T. AND WAGNER, D. 2006. Shortest path speedup techniques. In Algorithmic Methods for Railway Optimization. LNCS. Springer-Verlag, New York. To appear.
37. ZHAN, F. B. AND NOON, C. E. 2000. A comparison between label-setting and label-correcting algorithms for computing one-to-one shortest paths. Journal of Geographic Information and Decision Analysis 4, 2.
38. th European Symposium on Algorithms (ESA), LNCS. Springer-Verlag, New York. 33-48.