Preprocessing Speed-Up Techniques Is Hard-Reference-Cited by-同舟云学术

Preprocessing Speed-Up Techniques Is Hard

Published:2010 Issue: Volume: Page:359-370
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bauer Reinhard,Columbus Tobias,Katz Bastian,Krug Marcus,Wagner Dorothea

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-13073-1_32

Reference22 articles.

1. Lecture Notes in Computer Science;D. Delling,2009

2. Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. In: Proceedings of the 16th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 156–165 (2005)

3. Lauther, U.: An Extremely Fast, Exact Algorithm for Finding Shortest Paths in Static Networks with Geographical Background. In: Geoinformation und Mobilität - von der Forschung zur praktischen Anwendung. IfGI prints. vol. 22. pp. 219–230 (2004)

4. DIMACS Book;M. Hilger,2009

5. Bauer, R., Delling, D.: SHARC: Fast and Robust Unidirectional Routing. ACM Journal of Experimental Algorithmics 14 (May 2009); 2.4 Special Section on Selected Papers from ALENEX 2008

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parameterized Upper Bounds for Path-Consistent Hub Labeling;Lecture Notes in Computer Science;2024

2. MOOP: An Efficient Utility-Rich Route Planning Framework Over Two-Fold Time-Dependent Road Networks;IEEE Transactions on Emerging Topics in Computational Intelligence;2023-10

3. Efficient Distance Sensitivity Oracles for Real-World Graph Data;IEEE Transactions on Knowledge and Data Engineering;2021-01-01

4. Bundling all shortest paths;Discrete Applied Mathematics;2020-04

5. Phase Transition in Taxi Dynamics and Impact of Ridesharing;Transportation Science;2020-01-01