h1

h2

h3

h4

h5
h6
%0 Conference Paper
%A Bhaskar, Umang
%A Eickhoff, Katharina
%A Kauther, Lennart Kurt
%A Matuschke, Jannik
%A Peis, Britta
%A Vargas Koch, Laura
%T On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
%I Schloss Dagstuhl – Leibniz-Zentrum für InformatikSchloss Dagstuhl – Leibniz-Zentrum für InformatikSchloss Dagstuhl – Leibniz-Zentrum für Informatik
%M RWTH-2025-10181
%P 34:1-34:15
%D 2025
%< 33rd Annual European Symposium on Algorithms (ESA 2025)
%B 33. Annual European Symposium on Algorithms
%C ,  ()
%K Approximation Algorithms (Other)
%K Flows over Time (Other)
%K Min-Max Disjoint Paths (Other)
%K Scheduling (Other)
%K Theory of computation → Approximation algorithms analysis (Other)
%K Theory of computation → Graph algorithms analysis (Other)
%K Train Routing (Other)
%F PUB:(DE-HGF)8
%9 Contribution to a conference proceedings
%R 10.4230/LIPICS.ESA.2025.34
%U https://publications.rwth-aachen.de/record/1022685