This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
In several applications, data objects are assumed to move on predefined spatial networks such as road segments, railways, invisible air routes. Moving objects may exhibit similar...
Eleftherios Tiakas, Apostolos N. Papadopoulos, Ale...
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...
Roland Bader, Jonathan Dees, Robert Geisberger, Pe...
Applications ranging from location-based services to multi-player online gaming require continuous query support to monitor, track, and detect events of interest among sets of mov...
We present the first fast route planning algorithm that answers shortest paths queries for a customizable linear combination of two different metrics, e. g. travel time and energy...
Robert Geisberger, Moritz Kobitzsch, Peter Sanders