Transit nodes - Lower bounds and refined construction

Proceedings of the Workshop on Algorithm Engineering and Experiments

Volumn , Issue , 2012, Pages 141-149

  Eisner, Jochen ^a   Funke, Stefan ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INDUSTRIAL ENGINEERING;

ACCESS NODE; LOWER BOUNDS; LP FORMULATIONS; NONLOCAL; QUERY TIME; SIDE PRODUCTS; TRANSIT NODES;

ENGINEERING;

EID: 84882299227     PISSN: 21640300     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972924.14     Document Type: Conference Paper

References (11)

1. Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, and Renato Fonseca F. Werneck. Vc-dimension and shortest path algorithms. In Luca Aceto, Monika Henzinger, and Jiri Sgall, editors, ICALP (1), Volume 6755 of Lecture Notes in Computer Science, pages 690-699. Springer, 2011.
2. Ittai Abraham, Amos Fiat, Andrew V. Goldberg, and Renato Fonseca F. Werneck. Highway dimension, shortest paths, and provably efficient algorithms. In Moses Charikar, editor, SODA, pages 782-793. SIAM, 2010.
3. Holger Bast, Stefan Funke, and Domagoj Matijevic. Ultrafast shortest-path queries via transit nodes, Volume 74 of DIMACS Series on Disrecte Mathematics and Theoretical Computer Science, pages 175-192. AMS, Providence, RI, 2009.
4. Reinhard Bauer and Daniel Delling. Sharc: Fast and robust unidirectional routing. J. Exp. Algorithmics, 14:4:2.4-4:2.29, January 2010.
5. Robert Geisberger, Peter Sanders, Dominik Schultes, and Daniel Delling. Contraction hierarchies: faster and simpler hierarchical routing in road networks. In Proceedings of the 7th international conference on Experimental algorithms, WEA'08, pages 319-333, Berlin, Heidelberg, 2008. Springer-Verlag.
6. *: Efficient point-to-point shortest path algorithms. In 8th Workshop on Algorithm Engineering and Experiments (ALENEX'06), 2006.
7. Ron Gutman. Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In 6th Workshop on Algorithm Engineering and Experiments (ALENEX'04), 2004.
8. Moritz Hilger, Rolf H. Mohring, and Heiko Schilling. Fast point-to-point shortest path computations with arc-flags. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 2006.
9. Peter Sanders and Dominik Schultes. Highway hierarchies hasten exact shortest path queries. In 13th European Symposium on Algorithms (ESA'05), pages 568-579, 2005.
10. Peter Sanders and Dominik Schultes. Robust, Almost Constant Time Shortest-Path Queries via Transit Nodes, Volume 74 of DIMACS Series on Disrecte Mathematics and Theoretical Computer Science, pages 193-218. AMS, Providence, RI, 2009.
11. V.V. Vazirani. Approximation algorithms. Springer, 2001.