Fully dynamic speed-up techniques for multi-criteria shortest path searches in time-dependent networks

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

Volumn 6049 LNCS, Issue , 2010, Pages 35-46

  Berger, Annabell ^a   Grimmer, Martin ^a   Müller Hannemann, Matthias ^a  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

Dynamic graphs; Shortest paths; Speed up technique

Indexed keywords

COMPUTATIONAL STUDIES; DISTRIBUTED DELAYS; DYNAMIC CHANGES; DYNAMIC GRAPH; DYNAMIC SPEED; DYNAMIC UPDATE; GERMANY; HEAVY SNOWFALL; MULTI-CRITERIA; ON-THE-FLY; PARETO-OPTIMAL; SHORTEST PATH; SHORTEST PATH PROBLEM; SPEED-UP FACTORS; SPEED-UP TECHNIQUE; SPEED-UPS; TIME-DEPENDENT; TIME-DEPENDENT NETWORKS; TRAVEL TIME; TYPICAL DAY; VERTEX PARTITIONS;

ALGORITHMS; GRAPH THEORY; WIRELESS SENSOR NETWORKS;

SPEED;

EID: 78650668080     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13193-6_4     Document Type: Conference Paper

References (15)

1. Müller-Hannemann, M., Schnee, M.: Efficient timetable information in the presence of delays. In: Zaroliagis, C. (ed.) Robust and Online Large-Scale Optimization. LNCS, vol. 5868, pp. 249-272. Springer, Heidelberg (2009).
2. Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering route planning algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol. 5515, pp. 117-139. Springer, Heidelberg (2009).
3. Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway dimension, shortest paths, and provably efficient algorithms. In: SODA 2010: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 782- 793. SIAM, Philadelphia (2010).
4. Berger, A., Delling, D., Gebhardt, A., Müller-Hannemann, M.: Accelerating time-dependent multi-criteria timetable information is harder than expected. In: Clausen, J., Stefano, G.D. (eds.) ATMOS 2009 - 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Germany (2009).
5. Bauer, R., Delling, D., Wagner, D.: Experimental study on speed-up techniques for timetable information systems. Networks (to appear, 2010).
6. Bast, H.: Car or public transport-two worlds. In: Albers, S., Alt, H., Näher, S. (eds.) Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday. LNCS, vol. 5760, pp. 355-367. Springer, Heidelberg (2009).
7. Berger, A., Müller-Hannemann, M.: Subpath-optimality of multi-criteria shortest paths in time-dependent and event-dependent networks. Technical report, Martin- Luther-Universität Halle-Wittenberg, Department of Computer Science (2009).
8. Wagner, D., Willhalm, T., Zaroliagis, C.D.: Dynamic shortest paths containers. Electr. Notes Theor. Comput. Sci. 92, 65-84 (2004).
9. Schultes, D., Sanders, P.: Dynamic highway-node routing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol. 4525, pp. 66-79. Springer, Heidelberg (2007).
10. Delling, D., Wagner, D.: Landmark-based routing in dynamic graphs. In: Demetrescu, C. (ed.)WEA 2007. LNCS, vol. 4525, pp. 52-65. Springer, Heidelberg (2007).
11. Berrettini, E., D'Angelo, G., Delling, D.: Arc-flags in dynamic graphs. In: Clausen, J., Stefano, G.D. (eds.) ATMOS 2009 - 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Schloss Dagstuhl- Leibniz-Zentrum fuer Informatik, Germany (2009).
12. Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 319-333. Springer, Heidelberg (2008).
13. Nannicini, G., Baptiste, P., Krob, D., Liberti, L.: Fast computation of point-topoint paths on time-dependent road networks. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol. 5165, pp. 225-234. Springer, Heidelberg (2008).
14. Nannicini, G., Baptiste, P., Barbier, G., Krob, D., Liberti, L.: Fast paths in largescale dynamic road networks. Computational Optimization and Applications (published online, 2008).
15. Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM 37, 607-625 (1990).