17 citations · 23 across the 5 of their papers we have counts for
7 papers
T-REX: Fast and Dynamic Journey Planning for Continental-Scale Public Transit Networks
Jonas Sauer, Patrick Steil, Sascha Witt
We present T-REX (Transfer-Ranked EXploration), a new algorithm for journey planning in public transit networks on the country and continental scale. Our algorithm applies the prin…
FLASH-TB: Integrating Arc-Flags and Trip-Based Public Transit Routing
Ernestine Großmann, Jonas Sauer, Christian Schulz +2
We present FLASH-TB, a journey planning algorithm for public transit networks that combines Trip-Based Public Transit Routing (TB) with the Arc-Flags speedup technique. The basic i…
Extending the Time Horizon: Efficient Public Transit Routing on Arbitrary-Length Timetables
Sascha Witt
We study the problem of computing all Pareto-optimal journeys in a public transit network regarding the two criteria of arrival time and number of transfers taken. In recent years,…
Engineering In-place (Shared-memory) Sorting Algorithms
Michael Axtmann, Sascha Witt, Daniel Ferizovic +1
We present sorting algorithms that represent the fastest known techniques for a wide range of input sizes, input distributions, data types, and machines. A part of the speed advant…
In-place Parallel Super Scalar Samplesort (IPSo)
Michael Axtmann, Sascha Witt, Daniel Ferizovic +1
We present a sorting algorithm that works in-place, executes in parallel, is cache-efficient, avoids branch-mispredictions, and performs work O(n log n) for arbitrary inputs with h…
Trip-Based Public Transit Routing Using Condensed Search Trees
Sascha Witt
We study the problem of planning Pareto-optimal journeys in public transit networks. Most existing algorithms and speed-up techniques work by computing subjourneys to intermediary…
Trip-Based Public Transit Routing
Sascha Witt
We study the problem of computing all Pareto-optimal journeys in a public transit network regarding the two criteria of arrival time and number of transfers taken. We take a novel…