Gast ::
| 001 | 1022685 | ||
| 005 | 20260309114626.0 | ||
| 024 | 7 | _ | |2 doi |a 10.4230/LIPICS.ESA.2025.34 |
| 024 | 7 | _ | |2 SCOPUS |a SCOPUS:2-s2.0-105019059586 |
| 037 | _ | _ | |a RWTH-2025-10181 |
| 041 | _ | _ | |a English |
| 100 | 1 | _ | |a Bhaskar, Umang |b 0 |
| 111 | 2 | _ | |a 33. Annual European Symposium on Algorithms |g ESA 2025 |
| 245 | _ | _ | |a On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem |h online |
| 260 | _ | _ | |b Schloss Dagstuhl – Leibniz-Zentrum für InformatikSchloss Dagstuhl – Leibniz-Zentrum für InformatikSchloss Dagstuhl – Leibniz-Zentrum für Informatik |c 2025 |
| 295 | 1 | 0 | |a 33rd Annual European Symposium on Algorithms (ESA 2025) |
| 300 | _ | _ | |a 34:1-34:15 |
| 336 | 7 | _ | |0 33 |2 EndNote |a Conference Paper |
| 336 | 7 | _ | |0 PUB:(DE-HGF)8 |2 PUB:(DE-HGF) |a Contribution to a conference proceedings |b contrib |m contrib |s 1764608102_3064830 |
| 336 | 7 | _ | |2 BibTeX |a INPROCEEDINGS |
| 336 | 7 | _ | |2 DRIVER |a conferenceObject |
| 336 | 7 | _ | |2 DataCite |a Output Types/Conference Paper |
| 336 | 7 | _ | |2 ORCID |a CONFERENCE_PAPER |
| 588 | _ | _ | |a Dataset connected to DataCite |
| 650 | _ | 7 | |2 Other |a Approximation Algorithms |
| 650 | _ | 7 | |2 Other |a Flows over Time |
| 650 | _ | 7 | |2 Other |a Min-Max Disjoint Paths |
| 650 | _ | 7 | |2 Other |a Scheduling |
| 650 | _ | 7 | |2 Other |a Theory of computation → Approximation algorithms analysis |
| 650 | _ | 7 | |2 Other |a Theory of computation → Graph algorithms analysis |
| 650 | _ | 7 | |2 Other |a Train Routing |
| 700 | 1 | _ | |0 P:(DE-82)IDM05989 |a Eickhoff, Katharina |b 1 |u rwth |
| 700 | 1 | _ | |0 P:(DE-82)IDM06026 |a Kauther, Lennart Kurt |b 2 |u rwth |
| 700 | 1 | _ | |a Matuschke, Jannik |b 3 |
| 700 | 1 | _ | |0 P:(DE-82)IDM02810 |a Peis, Britta |b 4 |u rwth |
| 700 | 1 | _ | |0 P:(DE-82)IDM03630 |a Vargas Koch, Laura |b 5 |u rwth |
| 910 | 1 | _ | |0 I:(DE-588b)36225-6 |6 P:(DE-82)IDM05989 |a RWTH Aachen |b 1 |k RWTH |
| 910 | 1 | _ | |0 I:(DE-588b)36225-6 |6 P:(DE-82)IDM06026 |a RWTH Aachen |b 2 |k RWTH |
| 910 | 1 | _ | |0 I:(DE-588b)36225-6 |6 P:(DE-82)IDM02810 |a RWTH Aachen |b 4 |k RWTH |
| 910 | 1 | _ | |0 I:(DE-588b)36225-6 |6 P:(DE-82)IDM03630 |a RWTH Aachen |b 5 |k RWTH |
| 914 | 1 | _ | |y 2025 |
| 915 | 1 | _ | |0 StatID:(DE-HGF)0031 |2 StatID |a Peer reviewed article |x 0 |
| 920 | 1 | _ | |0 I:(DE-82)119830_20241018 |k 119830 ; 817720 |l Lehr- und Forschungsgebiet Algorithmische Spieltheorie und Diskrete Mathematik |x 0 |
| 920 | 1 | _ | |0 I:(DE-82)110000_20140620 |k 110000 |l Fachgruppe Mathematik |x 1 |
| 980 | _ | _ | |a I:(DE-82)110000_20140620 |
| 980 | _ | _ | |a I:(DE-82)119830_20241018 |
| 980 | _ | _ | |a UNRESTRICTED |
| 980 | _ | _ | |a VDBINPRINT |
| 980 | _ | _ | |a contrib |
| Library | Collection | CLSMajor | CLSMinor | Language | Author |
|---|