Graduiertenkolleg: Methods for Discrete Structures

Deutsche Forschungsgemeinschaft
faculty | junior-faculty | postdocs | students | associate students | former students | former associate students
locations | Term schedule | history
predoc-courses | schools | block-courses | workshops

Monday Lecture and Colloquium

Monday, July 13, 2009

Freie Universität Berlin
Institut für Informatik
Takustrasse 9
14195 Berlin

Lecture - 14:15

Stefan Funke, Greifswald

Shortest Paths on Road Networks

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

Letzte Aktualisierung: 30.06.2009