Computing earliest arrival flows with multiple sources - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Nadine Baumann, Martin Skutella. Computing earliest arrival flows with multiple sources. In Stefano Leonardi, Friedhelm Meyer auf der Heide, Dorothea Wagner, editors, Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005. Volume 05361 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, 2005. [doi]

The following publications are possibly variants of this publication:

Earliest Arrival Flows with Multiple SourcesNadine Baumann, Martin Skutella. mor, 34(2):499-512, 2009. [doi]

Solving Evacuation Problems Efficiently--Earliest Arrival Flows with Multiple SourcesNadine Baumann, Martin Skutella. focs 2006: 399-410 [doi]

Earliest Arrival Flows in Networks with Multiple SinksMelanie Schmidt, Martin Skutella. endm, 36:607-614, 2010. [doi]

Earliest arrival flows in networks with multiple sinksMelanie Schmidt, Martin Skutella. DAM, 164:320-327, 2014. [doi]

Evacuation by earliest arrival flowsNadine Baumann. PhD thesis, Dortmund University, Germany, 2007. [doi]

Approximating earliest arrival flows with flow-dependent transit timesNadine Baumann, Ekkehard Köhler. DAM, 155(2):161-171, 2007. [doi]

Approximating Earliest Arrival Flows with Flow-Dependent Transit TimesNadine Baumann, Ekkehard Köhler. mfcs 2004: 599-610 [doi]

runs on WebDSL