A hub-based labeling algorithm for shortest paths in road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Hierarchy decomposition for faster user equilibria on road networks
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
VC-dimension and shortest path algorithms
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Proceedings of the ACM SIGKDD International Workshop on Urban Computing
Candidate sets for alternative routes in road networks
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Exact graph search algorithms for generalized traveling salesman path problems
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
HLDB: location-based services in databases
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Optimizing Landmark-Based Routing and Preprocessing
Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science
| Hi-index | 0.00 |
We present a novel algorithm to solve the nonnegative single-source shortest path problem on road networks and other graphs with low highway dimension. After a quick preprocessing phase, we can compute all distances from a given source in the graph with essentially a linear sweep over all vertices. Because this sweep is independent of the source, we are able to reorder vertices in advance to exploit locality. Moreover, our algorithm takes advantage of features of modern CPU architectures, such as SSE and multi-core. Compared to Dijkstra's algorithm, our method needs fewer operations, has better locality, and is better able to exploit parallelism at multi-core and instruction levels. We gain additional speedup when implementing our algorithm on a GPU, where our algorithm is up to three orders of magnitude faster than Dijkstra's algorithm on a high-end CPU. This makes applications based on all-pairs shortest-paths practical for continental-sized road networks. Several algorithms, such as computing the graph diameter, exact arc flags, or centrality measures (exact reaches or betweenness), can be greatly accelerated by our method.