Approximating Earliest Arrival Flows in Arbitrary Networks
The earliest arrival flow problem is motivated by evacuation planning. It asks for a flow over time in a network with supplies and demands that maximizes the satisfied demands at every point in time. Gale  has shown the existence of such flows for networks with a single source and sink. For multiple sources and a single sink the existence follows from work by Minieka  and an exact algorithm has been presented by Baumann and Skutella [FOCS ’06]. If multiple sinks are present, it is known that earliest arrival flows do not exist in general.
We address the open question of approximating earliest arrival flows in arbitrary networks with multiple sinks and present constructive approximations of time and value for them. We give tight bounds for the best possible approximation factor in most cases. In particular, we show that there is always a 2-value-approximation of earliest arrival flows and that no better approximation factor is possible in general. Furthermore, we describe an FPTAS for computing the best possible approximation factor (which might be better than 2) along with the corresponding flow for any given instance.
KeywordsTransit Time Time Model Approximation Factor Discrete Time Model Early Arrival
Unable to display preview. Download preview PDF.
- 7.Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press (1962)Google Scholar
- 9.Groß, M., Skutella, M.: Generalized maximum flows over time. In: Proceedings of the 9th WAOA, pp. 247–260 (to appear, 2012)Google Scholar
- 10.Hoppe, B.: Efficient dynamic network flow algorithms. Ph.D. thesis, Cornell University (1995)Google Scholar
- 11.Hoppe, B., Tardos, É.: Polynomial time algorithms for some evacuation problems. In: Proceedings of the 5th SODA, pp. 433–441 (1994)Google Scholar
- 16.Schmidt, M., Skutella, M.: Earliest arrival flows in networks with multiple sinks. Discrete Applied Mathematics (2011), http://dx.doi.org/10.1016/j.dam.2011.09.023
- 17.Skutella, M.: An introduction to network flows over time. In: Cook, W., Lovász, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 451–482. Springer (2009)Google Scholar
- 18.Tjandra, S.A.: Dynamic network optimization with application to the evacuation problem. Ph.D. thesis, Technical University of Kaiserslautern (2003)Google Scholar