| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419108 | Discrete Applied Mathematics | 2014 | 8 Pages |
Abstract
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. Unfortunately, given a network with multiple sinks, flows over time satisfying this condition do not always exist. We analyze the special case of flows over time with zero transit times and characterize which networks always allow for earliest arrival flows.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Melanie Schmidt, Martin Skutella,