Sciweavers

Share
NETWORKS
2011
8 years 2 months ago
Earliest arrival flows on series-parallel graphs
We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival...
Stefan Ruzika, Heike Sperber, Mechthild Steiner
ENDM
2010
72views more  ENDM 2010»
8 years 7 months ago
Earliest Arrival Flows in Networks with Multiple Sinks
Earliest arrival flows model a central aspect of evacuation planning: In a dangerous situation, as many individuals as possible should be rescued at any point in time. Unfortunate...
Melanie Schmidt, Martin Skutella
books