Informatics Seminar (Perspective in Informatics 4B) 2011 - 2012
December 8 (Thu), 14:45 - 16:15
- Place:
Lecture Hall 1, Faculty of Engineering Bldg. No.10, Main Campus
- Title:
Algorithm Engineering for Route Planning
- Speaker:
Dorothea Wagner (Karlsruhe Institute of Technology)
- Abstract:
Nowadays, route planning systems belong to the most frequently used
information systems. The algorithmic core problem of such systems,
i.e., the fast computation of shortest paths is a
classical problem that can be solved by Dijkstra's shortest paths
algorithm. However, algorithms for route planning in transportation
networks
have recently undergone a rapid development, leading to methods that
are up to several million times faster than Dijkstra's algorithm.
In particular, computing shortest paths in huge networks
has become a showpiece of Algorithm Engineering demonstrating
the engineering cycle that consists of design, analysis,
implementation and experimental evaluation of practicable algorithms.
We will provide a condensed overview of the techniques enabling
this development.
Kyoto University
> Graduate School of Informatics
> International Courses
> Informatics Seminar