16 citations · 29 across the 19 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.DM2025
Stronger Hardness for Maximum Robust Flow and Randomized Network Interdiction
Jannik Matuschke
We study the following fundamental network optimization problem known as Maximum Robust Flow (MRF): A planner determines a flow on --paths in a given capacitated network. The…
cs.DS2025
Simultaneous Network Design with Restricted Link Usage
Naonori Kakimura, Péter Madarasi, Jannik Matuschke +1
Given a digraph with two terminal vertices and as well as a conservative cost function and several not necessarily disjoint color classes on its arc set, our goal is to fin…
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…