Combining speed-up techniques for shortest-path computations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3059, Issue , 2004, Pages 269-284

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

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIRECTED GRAPHS;

DIRECTED SEARCHES; MULTILEVEL APPROACH; PUBLIC TRANSPORT; RANDOM GRAPHS; REAL-WORLD GRAPHS; SHORTEST PATH; SHORTEST PATH COMPUTATIONS; SPEED-UP TECHNIQUES;

GRAPH THEORY;

EID: 24944499911     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24838-5_20     Document Type: Article

References (27)

1. Zhan, F.B., Noon, C.E.: A comparison between label-setting and label-correcting algorithms for computing one-to-one shortest paths. Journal of Geographic Information and Decision Analysis 4 (2000)
2. Barrett, C., Bisset, K., Jacob, R., Konjevod, G., Marathe, M.: Classical and contemporary shortest path problems in road networks: Implementation and experimental analysis of the TRANSIMS router. In: Proc. 10th European Symposium on Algorithms (ESA). Volume 2461 of LNCS., Springer (2002) 126-138
3. Nachtigall, K.: Time depending shortest-path problems with applications to railway networks. European Journal of Operational Research 83 (1995) 154-166
4. Preuss, T., Syrbe, J.H.: An integrated traffic information system. In: Proc. 6th Int. Conf. Appl. Computer Networking in Architecture, Construction, Design, Civil Eng., and Urban Planning (europIA '97). (1997)
5. Shekhar, S., Fetterer, A., Goyal, B.: Materialization trade-offs in hierarchical shortest path algorithms. In: Proc. Symp. on Large Spatial Databases. (1997) 94-111
6. Barrett, C., Jacob, R., Marathe, M.: Formal-language-constrained path problems. SIAM Journal on Computing 30 (2000) 809-837
7. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1 (1959) 269-271
8. Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM 34 (1987) 596-615
9. Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming 73 (1996) 129-174
10. Zwick, U.: Exact and approximate distances in graphs - a survey. In: Proc. 9th European Symposium on Algorithms (ESA). LNCS, Springer (2001) 33-48
11. Goldberg, A.V.: A simple shortest path algorithm with linear average time. In: Proc. 9th European Symposium on Algorithms (ESA). Volume 2161 of LNCS., Springer (2001) 230-241
12. Meyer, U.: Single-source shortest-paths on arbitrary directed graphs in linear average-case time. In: Proc. 12th Symp. on Discrete Algorithms. (2001) 797-806
13. Pettie, S., Ramachandran, V., Sridhar, S.: Experimental evaluation of a new shortest path algorithm. In: Proc. Algorithm Engineering and Experiments (ALENEX). Volume 2409 of LNCS., Springer (2002) 126-142
14. Hart, P., Nilsson, N.J., Raphael, B.A.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Sys. Sci. Cybernet. 2 (1968)
15. Shekhar, S., Kohli, A., Coyle, M.: Path computation algorithms for advanced traveler information system (ATIS). In: Proc. 9th IEEE Int. Conf. Data Eng. (1993) 31-39
16. Schulz, F., Wagner, D., Weihe, K.: Dijkstra's algorithm on-line: An empirical case study from public railroad transport. ACM Journal of Exp. Algorithmics 5 (2000)
17. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice-Hall (1993)
18. Pohl, I.: Bi-directional and heuristic search in path problems. Technical Report 104, Stanford Linear Accelerator Center, Stanford, California (1969)
19. Kaindl, H., Kainz, G.: Bidirectional heuristic search reconsidered. Journal of Artificial Intelligence Research 7 (1997) 283-317
20. Holzer, M.: Hierarchical speed-up techniques for shortest-path algorithms. Technical report, Dept. of Informatics, University of Konstanz, Germany (2003) http://www.ub.uni-konstanz.de/kops/volltexte/2003/1038/.
21. Schulz, F., Wagner, D., Zaroliagis, C.: Using multi-level graphs for timetable information in railway systems. In: Proc. 4th Workshop on Algorithm Engineering and Experiments (ALENEX). Volume 2409 of LNCS., Springer (2002) 43-59
22. Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. IEEE Transactions on Knowledge and Data Engineering 14 (2002) 1029-1046
23. Wagner, D., Willhalm, T.: Geometric speed-up techniques for finding shortest paths in large sparse graphs. In: Proc. 11th European Symposium on Algorithms (ESA). Volume 2832 of LNCS., Springer (2003) 776-787
24. Näher, S., Mehlhorn, K.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press (1999) (http://www. algorithmicsolutions.com).
25. Waxman, B.M.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications 6 (1988)
26. Dial, R.: Algorithm 360: Shortest path forest with topological ordering. Communications of ACM 12 (1969) 632-633
27. Goldberg, A.V.: Shortest path algorithms: Engineering aspects. In: Proc. International Symposium on Algorithms and Computation (ISAAC). Volume 2223 of LNCS., Springer (2001) 502-513