97 citations · 229 across the 33 of their papers we have counts for
7 papers · 2 filters
Dynamic Time-Dependent Route Planning in Road Networks with User Preferences
Moritz Baum, Julian Dibbelt, Thomas Pajor +1
There has been tremendous progress in algorithmic methods for computing driving directions on road networks. Most of that work focuses on time-independent route planning, where it…
Fast Computation of Isochrones in Road Networks
Moritz Baum, Valentin Buchhold, Julian Dibbelt +1
We study the problem of computing isochrones in road networks, where the objective is to identify the region that is reachable from a given source within a certain amount of time.…
Engineering Oracles for Time-Dependent Road Networks
Spyros Kontogiannis, George Michalopoulos, Georgia Papastavrou +3
We implement and experimentally evaluate landmark-based oracles for min-cost paths in large-scale time-dependent road networks. We exploit parallelism and lossless compression, com…
Fast Exact Shortest Path and Distance Queries on Road Networks with Parametrized Costs
Julian Dibbelt, Ben Strasser, Dorothea Wagner
We study a scenario for route planning in road networks, where the objective to be optimized may change between every shortest path query. Since this invalidates many of the known…
Fast Quasi-Threshold Editing
Ulrik Brandes, Michael Hamann, Ben Strasser +1
We introduce Quasi-Threshold Mover (QTM), an algorithm to solve the quasi-threshold (also called trivially perfect) graph editing problem with edge insertion and deletion. Given a…
Route Planning in Transportation Networks
Hannah Bast, Daniel Delling, Andrew Goldberg +5
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 ev…