3 papers
cs.DS2025
Fare Zone Assignment on Trees
Martin Hoefer, Lennart Kauther, Philipp Pabst +2
Designing fare systems for public transportation networks is a challenging task. A popular approach is to partition the network into fare zones (``zoning'') and fix journey prices…
cs.DS2025
On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
Umang Bhaskar, Katharina Eickhoff, Lennart Kauther +3
In train routing, the headway is the minimum distance that must be maintained between successive trains for safety and robustness. We introduce a model for train routing that requi…
cs.GT2023
Stackelberg Vertex Cover on a Path
Katharina Eickhoff, Lennart Kauther, Britta Peis
A Stackelberg Vertex Cover game is played on an undirected graph where some of the vertices are under the control of a \emph{leader}. The remaining vertices are assig…