Search-Space Size in Contraction Hierarchies-Reference-Cited by-同舟云学术

Search-Space Size in Contraction Hierarchies

Published:2013 Issue: Volume: Page:93-104
ISSN:0302-9743
Container-title:Automata, Languages, and Programming
language:
Short-container-title:

Author:

Bauer Reinhard,Columbus Tobias,Rutter Ignaz,Wagner Dorothea

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-39206-1_9

Reference17 articles.

1. Lecture Notes in Computer Science;I. Abraham,2011

2. Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway Dimension, Shortest Paths, and Provably Efficient Algorithms. In: Proc. 21st Annual ACM–SIAM Symp. Disc. Alg. (SODA 2010), pp. 782–793. SIAM (2010)

3. Bauer, R., Baum, M., Rutter, I., Wagner, D.: On the Complexity of Partitioning Graphs for Arc-Flags. In: Proc. 12th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2012). OpenAccess Series in Informatics (OASIcs), pp. 71–82 (2012)

4. Lecture Notes in Computer Science;R. Bauer,2010

5. Lecture Notes in Computer Science;H.L. Bodlaender,1992

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

1. Aggregating Pairwise Information Over Optimal Routes;Proceedings of the 9th International Conference on Vehicle Technology and Intelligent Transport Systems;2023

2. Sublinear search spaces for shortest path planning in grid and road networks;Journal of Combinatorial Optimization;2021-07-29

3. A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels and a Provably Optimal Instance-Based Schema;Algorithms;2021-05-25

4. A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels;Computer Science – Theory and Applications;2020

5. Graph Bisection with Pareto Optimization;ACM Journal of Experimental Algorithmics;2018-11-15