25 citations · 33 across the 6 of their papers we have counts for
6 papers
Compressed Transmission of Route Descriptions
Gernot Veit Batz, Robert Geisberger, Dennis Luxen +1
We present two methods to compress the description of a route in a road network, i.e., of a path in a directed graph. The first method represents a path by a sequence of via edges.…
Engineering Time-dependent One-To-All Computation
Robert Geisberger
Very recently a new algorithm to the nonnegative single-source shortest path problem on road networks has been discovered. It is very cache-efficient, but only on static road netwo…
Defining and Computing Alternative Routes in Road Networks
Jonathan Dees, Robert Geisberger, Peter Sanders +1
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 rou…
Heuristic Contraction Hierarchies with Approximation Guarantee
Robert Geisberger
We present a new heuristic point-to-point routing algorithm based on contraction hierarchies (CH). Given an epsilon >= 0, we can prove that the length of the path computed by our a…
Contraction of Timetable Networks with Realistic Transfers
Robert Geisberger
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This re…
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…