guest ::
001022685 001__ 1022685 001022685 005__ 20260202093606.0 001022685 0247_ $$2doi$$a10.4230/LIPICS.ESA.2025.34 001022685 0247_ $$2SCOPUS$$aSCOPUS:2-s2.0-105019059586 001022685 037__ $$aRWTH-2025-10181 001022685 041__ $$aEnglish 001022685 1001_ $$aBhaskar, Umang$$b0 001022685 1112_ $$a33. Annual European Symposium on Algorithms$$gESA 2025 001022685 245__ $$aOn the Approximability of Train Routing and the Min-Max Disjoint Paths Problem$$honline 001022685 260__ $$bSchloss Dagstuhl – Leibniz-Zentrum für InformatikSchloss Dagstuhl – Leibniz-Zentrum für InformatikSchloss Dagstuhl – Leibniz-Zentrum für Informatik$$c2025 001022685 29510 $$a33rd Annual European Symposium on Algorithms (ESA 2025) 001022685 300__ $$a34:1-34:15 001022685 3367_ $$033$$2EndNote$$aConference Paper 001022685 3367_ $$0PUB:(DE-HGF)8$$2PUB:(DE-HGF)$$aContribution to a conference proceedings$$bcontrib$$mcontrib$$s1764608102_3064830 001022685 3367_ $$2BibTeX$$aINPROCEEDINGS 001022685 3367_ $$2DRIVER$$aconferenceObject 001022685 3367_ $$2DataCite$$aOutput Types/Conference Paper 001022685 3367_ $$2ORCID$$aCONFERENCE_PAPER 001022685 588__ $$aDataset connected to DataCite 001022685 650_7 $$2Other$$aApproximation Algorithms 001022685 650_7 $$2Other$$aFlows over Time 001022685 650_7 $$2Other$$aMin-Max Disjoint Paths 001022685 650_7 $$2Other$$aScheduling 001022685 650_7 $$2Other$$aTheory of computation → Approximation algorithms analysis 001022685 650_7 $$2Other$$aTheory of computation → Graph algorithms analysis 001022685 650_7 $$2Other$$aTrain Routing 001022685 7001_ $$0P:(DE-82)IDM05989$$aEickhoff, Katharina$$b1$$urwth 001022685 7001_ $$0P:(DE-82)IDM06026$$aKauther, Lennart Kurt$$b2$$urwth 001022685 7001_ $$aMatuschke, Jannik$$b3 001022685 7001_ $$0P:(DE-82)IDM02810$$aPeis, Britta$$b4$$urwth 001022685 7001_ $$0P:(DE-82)IDM03630$$aVargas Koch, Laura$$b5$$urwth 001022685 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM05989$$aRWTH Aachen$$b1$$kRWTH 001022685 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM06026$$aRWTH Aachen$$b2$$kRWTH 001022685 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM02810$$aRWTH Aachen$$b4$$kRWTH 001022685 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM03630$$aRWTH Aachen$$b5$$kRWTH 001022685 9141_ $$y2025 001022685 9151_ $$0StatID:(DE-HGF)0031$$2StatID$$aPeer reviewed article$$x0 001022685 9201_ $$0I:(DE-82)119830_20241018$$k119830 ; 817720$$lLehr- und Forschungsgebiet Algorithmische Spieltheorie und Diskrete Mathematik$$x0 001022685 9201_ $$0I:(DE-82)110000_20140620$$k110000$$lFachgruppe Mathematik$$x1 001022685 961__ $$c2025-12-01T17:56:53.301971$$x2025-12-01T17:56:53.301971$$z2025-12-02 001022685 980__ $$aI:(DE-82)110000_20140620 001022685 980__ $$aI:(DE-82)119830_20241018 001022685 980__ $$aUNRESTRICTED 001022685 980__ $$aVDBINPRINT 001022685 980__ $$acontrib