During recent years, impressive speed-up techniques for Dijkstra's have been developed.
Unfortunately, the most advanced techniques use bidirectional search, which makes it hard …

Algorithms for route planning in transportation networks have recently undergone a rapid
development, leading to methods that are up to one million times faster than Dijkstra's …

An overlay graph of a given graph G=(V, E) on a subset S⊆ V is a graph with vertex set S
and edges corresponding to shortest paths in G. In particular, we consider variations of the …

Many speed-up techniques for route planning in static graphs exist, only few of them are
proven to work in a dynamic scenario. Most of them use preprocessed information, which …

During the last years, several speed-up techniques for Dijkstra's algorithm have been
published that maintain the correctness of the algorithm but reduce its running time for …

We introduce the concept of transit nodes, as a means for preprocessing a road network,
with given coordinates for each node and a travel time for each edge, such that point-to …

We present a fast algorithm for computing all shortest paths between source nodes s∊ S and
target nodes t∊ T. This problem is important as an initial step for many operations research …

A reachability oracle (or hop labeling) assigns each vertex v two sets of vertices: Lout (v) and
Lin (v), such that u reaches v iff Lout (u)\cap Lin (v)\neq\emptyset. Despite their simplicity and …

We present significant improvements to a practical algorithm for the point-to-point shortest
path problem on road networks that combines A* search, landmark-based lower bounds …

In recent years, many speed up techniques for Dijkstra Algorithm have been developed.
Unfortunately, research mainly focused on road networks although fast algorithms are also …