Earliest Arrival Flows in Networks with Multiple Sinks

@article{Schmidt2010EarliestAF,
  title={Earliest Arrival Flows in Networks with Multiple Sinks},
  author={Melanie Schmidt and Martin Skutella},
  journal={Electronic Notes in Discrete Mathematics},
  year={2010},
  volume={36},
  pages={607-614}
}
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. 

2 Figures & Tables