Transit node routing reconsidered

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

Volumn 7933 LNCS, Issue , 2013, Pages 55-66

  Arz, Julian ^a   Luxen, Dennis ^a   Sanders, Peter ^a  

^a KARLSRUHE INSTITUTE OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MANY-TO-ONE; NEW RESULTS; ORDERS OF MAGNITUDE; QUERY TIME; ROAD NETWORK; SHORTEST PATH PROBLEM; TRANSIT NODES;

GRAPH THEORY;

ALGORITHMS;

EID: 84884379036     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-38527-8_7     Document Type: Conference Paper

References (24)

1. 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)
2. Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact Routing in Large Road Networks Using Contraction Hierarchies. Transportation Science 46(3), 388-404 (2012)
3. Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast Routing in Road Networks with Transit Nodes. Science 316(5824), 566 (2007)
4. Bast, H., Funke, S., Matijevic, D.: TRANSIT - Ultrafast Shortest-Path Queries with Linear-Time Preprocessing. In: Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.) 9th DIMACS Implementation Challenge - Shortest Paths (2006)
5. Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In Transit to Constant Shortest-Path Queries in Road Networks. In: Proceedings of the 9th Workshop on Algorithm Engineering and Experiments, ALENEX 2007, pp. 46-59. SIAM (2007)
6. Geisberger, R.: Contraction Hierarchies. Master's thesis, Universität Karlsruhe (2008), http://algo2.iti.kit.edu/1094.php
7. Schultes, D.: Route Planning in Road Networks. PhD thesis, Universität Karlsruhe (February 2008), http://algo2.iti.uka.de/schultes/ hwy/schultes-diss.pdf
8. Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics. LNCS, vol. 5515, pp. 117-139. Springer, Heidelberg (2009)
9. Sanders, P., Schultes, D.: Engineering Highway Hierarchies. ACM Journal of Experimental Algorithmics 17(1), 1-40 (2012)
10. Bast, H.: Lecture slides: Efficient route planning, http://ad-wiki. informatik.uni-freiburg.de/teaching/EfficientRoutePlanningSS2012
11. Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: A Hub-Based Labeling Algorithm for Shortest Paths on Road Networks. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 230-241. Springer, Heidelberg (2011)
12. Delling, D., Goldberg, A.V., Werneck, R.F.: Faster Batched Shortest Paths in Road Networks. In: 11th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. OpenAccess Series in Informatics (OASIcs), vol. 20, pp. 52-63 (2011)
13. Vetter, C.: Fast and Exact Mobile Navigation with OpenStreetMap Data. Master's thesis, Karlsruhe Institute of Technology (2010)
14. Knopp, S., Sanders, P., Schultes, D., Schulz, F., Wagner, D.: Computing Many-to-Many Shortest Paths Using Highway Hierarchies. In: 9th Workshop on Algorithm Engineering and Experiments, pp. 36-45. SIAM (2007)
15. Mehlhorn, K.: A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters 27(3), 125-128 (1988)
16. Vetter, C.: Parallel Time-Dependent Contraction Hierarchies. Studienarbeit, Karlsruhe Institute of Technology (2009), http://algo2.iti.kit. edu/download/vetter-sa.pdf
17. Demetrescu, C., Goldberg, A.V., Johnson, D.S. (eds.): The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Book, vol. 74. American Mathematical Society (2009)
18. Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm. ACM Journal of Experimental Algorithmics 15(2.3), 1-31 (2010),
19. Special Section devoted to In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 303-318. Springer, Heidelberg (2008)
20. Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical Hub Labelings for Shortest Paths. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 24-35. Springer, Heidelberg (2012)
21. Delling, D., Goldberg, A.V., Werneck, R.F.: Hub Label Compression. In: Bonifaci, V. (ed.) SEA 2013. LNCS, vol. 7933, pp. 17-28. Springer, Heidelberg (2013)
22. Eisner, J., Funke, S.: Transit Nodes - Lower Bounds and Refined Construction. In: Proceedings of the 14th Meeting on Algorithm Engineering and Experiments, ALENEX 2012, pp. 141-149. SIAM (2012)
23. Delling, D., Goldberg, A.V., Nowatzyk, A., Werneck, R.F.: PHAST: Hardware- Accelerated Shortest Path Trees. In: 25th International Parallel and Distributed Processing Symposium, IPDPS 2011 (2011)
24. Arz, J., Luxen, D., Sanders, P.: Transit Node Routing Reconsidered. Technical report, Karlsruhe Institute of Technology (2012)