Monday, July 13, 2009
Freie Universität Berlin
Institut für Informatik
Takustrasse 9
14195 Berlin
Lecture - 14:15
Abstract:
While Dijkstra's algorithm is still the method of choice for general
networks with nonnegative edge weights, road networks exhibit properties
that allow for more efficient shortest-path computations, in particular if
one can afford a bit of preprocessing.
We review some of the recent techniques that allow for speed-ups of several
orders of magnitude.
No Colloquium today