h1

001019858 001__ 1019858
001019858 005__ 20260114074028.0
001019858 0247_ $$2ISBN$$a978-3-95977-395-9
001019858 0247_ $$2ISSN$$a1868-8969
001019858 0247_ $$2SCOPUS$$aSCOPUS:2-s2.0-105019056534
001019858 0247_ $$2doi$$a10.4230/LIPICS.ESA.2025.112
001019858 037__ $$aRWTH-2025-08597
001019858 041__ $$aEnglish
001019858 1001_ $$0P:(DE-82)IDM04471$$aAnapolska, Mariia$$b0$$urwth
001019858 1112_ $$a33. Annual European Symposium on Algorithms$$cWarsaw$$d2025-09-15 - 2025-09-17$$gESA 2025$$wPoland
001019858 245__ $$aA Faster Parametric Search for the Integral Quickest Transshipment Problem$$honline
001019858 260__ $$bSchloss Dagstuhl – Leibniz-Zentrum für Informatik$$c2025
001019858 29510 $$a33rd Annual European Symposium on Algorithms : ESA 2025, September 15–17, 2025, Warsaw, Poland / edited by Anne Benoit, Haim Kaplan, Sebastian Wild, Grzegorz Herman
001019858 3367_ $$033$$2EndNote$$aConference Paper
001019858 3367_ $$0PUB:(DE-HGF)7$$2PUB:(DE-HGF)$$aContribution to a book
001019858 3367_ $$0PUB:(DE-HGF)8$$2PUB:(DE-HGF)$$aContribution to a conference proceedings$$bcontrib$$mcontrib$$s1760358349_3890629
001019858 3367_ $$2BibTeX$$aINPROCEEDINGS
001019858 3367_ $$2DRIVER$$aconferenceObject
001019858 3367_ $$2DataCite$$aOutput Types/Conference Paper
001019858 3367_ $$2ORCID$$aCONFERENCE_PAPER
001019858 4900_ $$aLeibniz international proceedings in informatics$$v351
001019858 536__ $$0G:(GEPRIS)282652900$$aGRK 2236 - GRK 2236: Unsicherheit und Randomisierung in Algorithmen, Verifikation und Logik. (282652900)$$c282652900$$x0
001019858 536__ $$0G:(GEPRIS)504292598$$aSFB 1481 B05 - Sparsifizierung zeitabhängiger Netzwerkflußprobleme mittels diskreter Optimierung (B05) (504292598)$$c504292598$$x1
001019858 536__ $$0G:(GEPRIS)442047500$$aDFG project G:(GEPRIS)442047500 - SFB 1481: Sparsity und singuläre Strukturen (442047500)$$c442047500$$x2
001019858 588__ $$aDataset connected to DataCite
001019858 591__ $$aGermany
001019858 650_7 $$2Other$$aFlow over time
001019858 650_7 $$2Other$$aTheory of computation → Network flows
001019858 650_7 $$2Other$$adynamic transshipment
001019858 650_7 $$2Other$$aefficient algorithms
001019858 650_7 $$2Other$$aparametric submodular functions
001019858 650_7 $$2Other$$aquickest transshipment
001019858 7001_ $$0P:(DE-82)IDM07343$$avan den Boom, Dario$$b1$$eCorresponding author$$urwth
001019858 7001_ $$0P:(DE-82)IDM02252$$aBüsing, Christina Maria Katharina$$b2$$urwth
001019858 7001_ $$0P:(DE-82)IDM06469$$aGersing, Timo$$b3$$urwth
001019858 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM04471$$aRWTH Aachen$$b0$$kRWTH
001019858 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM07343$$aRWTH Aachen$$b1$$kRWTH
001019858 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM02252$$aRWTH Aachen$$b2$$kRWTH
001019858 9101_ $$0I:(DE-588b)36225-6$$6P:(DE-82)IDM06469$$aRWTH Aachen$$b3$$kRWTH
001019858 9141_ $$y2025
001019858 9151_ $$0StatID:(DE-HGF)0031$$2StatID$$aPeer reviewed article$$x0
001019858 9201_ $$0I:(DE-82)125620_20210528$$k125620$$lLehr- und Forschungsgebiet Kombinatorische Optimierung$$x0
001019858 961__ $$c2025-10-14T13:45:37.067450$$x2025-10-14T13:45:37.067450$$z2025-10-14
001019858 980__ $$aI:(DE-82)125620_20210528
001019858 980__ $$aUNRESTRICTED
001019858 980__ $$aVDBINPRINT
001019858 980__ $$acontb
001019858 980__ $$acontrib