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 …

The single source shortest path problem for arbitrary directed graphs with n nodes, m edges
and nonnegative edge weights can sequentially be solved using O (n· log n+ m) operations …

The design of approximation algorithms for spanning tree problems has become an exciting
and important area of theoretical computer science and also plays a significant role in …

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 …

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 …

Emergency events, such as earthquakes, hurricanes, fires, chemical accidents, nuclear
accidents, terror attacks and other events may led to injured or endanger the life and the …

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 …

A fundamental approach in finding efficiently best routes or optimal itineraries in traffic
information systems is to reduce the search space (part of graph visited) of the most …