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 study of algorithms on grids has been widespread in a number of research areas. Grids
are easy to implement and offer fast memory access. Because of their simplicity, they are …

Abstract Abraham et al.[SODA 2010] have recently presented a theoretical analysis of
several practical point-to-point shortest path algorithms based on modeling road networks …

Computing driving directions has motivated many shortest path heuristics that answer
queries on continental scale networks, with tens of millions of intersections, literally instantly …

We propose the first routing engine for computing driving directions in large-scale road
networks that satisfies all requirements of a real-world production system. It supports …

Many online services let users query public datasets such as maps, flight prices, or
restaurant reviews. Unfortunately, the queries to these services reveal highly sensitive …

Computing the shortest path between two vertices is a fundamental problem in road
networks that is applied in a wide variety of applications. To support efficient shortest path …

Computing driving directions has motivated many shortest path algorithms based on
preprocessing. Given a graph, the preprocessing stage computes a modest amount of …

There are two kinds of people: those who travel by car, and those who use public transport.
The topic of this article is to show that the algorithmic problem of computing the fastest way …

Computing the shortest path for any two given vertices is an important problem in road
networks. Since real road networks are dynamically updated due to real-time traffic …