The Shortest Path Problem

Real-world applications of shortest path algorithms by J. L. Santos An experimental evaluation of point-to-point shortest path calculation on road networks with precalculated edge-flags by U. Lauther Fast point-to-point shortest path computations with arc-flags by M. Hilger, E. Kohler, R. H. Mohring, and H. Schilling High-performance multi-level routing by D. Delling, M. Holzer, K. Muller, F. Schulz, and D. Wagner Reach for A*: shortest path algorithms with preprocessing by A. V. Goldberg, H. Kaplan, and R. F. Werneck Highway hierarchies star by D. Delling, P. Sanders, D. Schultes, and D. Wagner Ultrafast shortest-path queries via transit nodes by H. Bast, S. Funke, and D. Matijevic Robust, almost constant time shortest-path queries in road networks by P. Sanders and D. Schultes Single-source shortest paths with the parallel boost graph library by N. Edmonds, A. Breuer, D. Gregor, and A. Lumsdaine Parallel shortest path algorithms for solving large-scale instances by K. Madduri, D. A. Bader, J. W. Berry, and J. R. Crobak Breadth first search on massive graphs by D. Ajwani, U. Meyer, and V. Osipov Engineering label-constrained shortest-path algorithms by C. L. Barrett, K. Bisset, M. Holzer, G. Konjevod, M. V. Marathe, and D. Wagner Bibliography by C. Demetrescu, A. V. Goldberg, and D. S. Johnson