Combines Contraction Hierarchies with the Connection Scan Algorithm to improve shortest-path queries over bidirectional Dijkstra or A* on Contraction Hierarchies.
Shortest path algorithms in transportation models: classical and innovative aspects
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Combining the Connection Scan Algorithm with Contraction Hierarchies
Combines Contraction Hierarchies with the Connection Scan Algorithm to improve shortest-path queries over bidirectional Dijkstra or A* on Contraction Hierarchies.