25 citations · 37 across the 3 of their papers we have counts for
3 papers
cs.DS2009★ 25 cited
Fast Detour Computation for Ride Sharing
Robert Geisberger, Dennis Luxen, Sabine Neubauer +2
Todays ride sharing services still mimic a better billboard. They list the offers and allow to search for the source and target city, sometimes enriched with radial search. So find…
cs.DS2009★ 5 cited
Towards Optimal Range Medians
Beat Gfeller, Peter Sanders
We consider the following problem: given an unsorted array of elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the int…
cs.DS2008★ 7 cited
Time Dependent Contraction Hierarchies -- Basic Algorithmic Ideas
Peter Sanders
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks with…