There are a number of transportation applications that require the use of a heuristic shortest
path algorithm rather than one of the standard, optimal algorithms. This is primarily due to …

We consider the point-to-point (approximate) shortest-path query problem, which is the
following generalization of the classical single-source (SSSP) and all-pairs shortest-path …

We survey recent advances in algorithms for route planning in transportation networks. For
road networks, we show that one can compute driving directions in milliseconds or less even …

The shortest path problem is a fundamental problem with numerous applications. In this
paper we study one of the most common variants of the problem, where the goal is to find a …

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

In this paper we study approximate landmark-based methods for point-to-point distance
estimation in very large networks. These methods involve selecting a subset of nodes as …

We study the point-to-point shortest path problem in a setting where preprocessing is
allowed. We improve the reach-based approach of Gutman [17] in several ways. In …

Traffic congestion is a severe problem in many modern cities around the world. To solve the
problem, we have proposed a framework for a dynamic and automatic traffic light control …

We study the ALT algorithm [19] for the point-to-point shortest path problem in the context of
road networks. We suggest improvements to the algorithm itself and to its preprocessing …

In this paper, we present an overview over existing speed-up techniques for time-dependent
route planning. Apart from only explaining each technique one by one, we follow a more …