h1

h2

h3

h4

h5
h6
TY  - CONF
AU  - Bhaskar, Umang
AU  - Eickhoff, Katharina
AU  - Kauther, Lennart Kurt
AU  - Matuschke, Jannik
AU  - Peis, Britta
AU  - Vargas Koch, Laura
TI  - On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
PB  - Schloss Dagstuhl – Leibniz-Zentrum für InformatikSchloss Dagstuhl – Leibniz-Zentrum für InformatikSchloss Dagstuhl – Leibniz-Zentrum für Informatik
M1  - RWTH-2025-10181
SP  - 34:1-34:15
PY  - 2025
T2  - 33. Annual European Symposium on Algorithms
CY  - ,  ()
KW  - Approximation Algorithms (Other)
KW  - Flows over Time (Other)
KW  - Min-Max Disjoint Paths (Other)
KW  - Scheduling (Other)
KW  - Theory of computation → Approximation algorithms analysis (Other)
KW  - Theory of computation → Graph algorithms analysis (Other)
KW  - Train Routing (Other)
LB  - PUB:(DE-HGF)8
DO  - DOI:10.4230/LIPICS.ESA.2025.34
UR  - https://publications.rwth-aachen.de/record/1022685
ER  -