4 papers · 1 filter
The Expiration Streaming Model: Diameter, -Center, Counting, Sampling, and Friends
Lotte Blank, Sergio Cabello, MohammadTaghi Hajiaghayi +5
An important thread in the study of data-stream algorithms focuses on settings where stream items are active only for a limited time. We introduce a new expiration model, where eac…
A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order
Arne Beines, Michael Kaibel, Philip Mayer +2
We present parametric breadth-first search (PBFS), a new algorithm for solving the parametric minimum cut problem in a network with source-sink-monotone capacities. The objective i…
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…
Fast and Delay-Robust Multimodal Journey Planning
Dominik Bez, Jonas Sauer
We study journey planning in multimodal networks consisting of public transit plus an unrestricted transfer mode (e.g., walking or cycling). In order to provide good results in pra…