Abstract
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 [1959] 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 [1973] 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.
This work was supported by DFG Research Center Matheon “Mathematics for key technologies” in Berlin and by DFG grant SO 514/4-3.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baumann, N., Skutella, M.: Solving evacuation problems efficiently: Earliest arrival flows with multiple sources. Mathematics of Operations Research 34(2), 499–512 (2009)
Baumann, N., Köhler, E.: Approximating earliest arrival flows with flow-dependent transit times. Discrete Applied Mathematics 155(2), 161–171 (2007)
Burkard, R.E., Dlaska, K., Klinz, B.: The quickest flow problem. Mathematical Methods of Operations Research 37, 31–58 (1993)
Fleischer, L.K.: Faster algorithms for the quickest transshipment problem. SIAM Journal on Optimization 12(1), 18–35 (2001)
Fleischer, L.K., Skutella, M.: Quickest flows over time. SIAM Journal on Computing 36(6), 1600–1630 (2007)
Fleischer, L.K., Tardos, É.: Efficient continuous-time dynamic network flow algorithms. Operations Research Letters 23(3-5), 71–80 (1998)
Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press (1962)
Gale, D.: Transient flows in networks. Michigan Mathematical Journal 6, 59–63 (1959)
Groß, M., Skutella, M.: Generalized maximum flows over time. In: Proceedings of the 9th WAOA, pp. 247–260 (to appear, 2012)
Hoppe, B.: Efficient dynamic network flow algorithms. Ph.D. thesis, Cornell University (1995)
Hoppe, B., Tardos, É.: Polynomial time algorithms for some evacuation problems. In: Proceedings of the 5th SODA, pp. 433–441 (1994)
Hoppe, B., Tardos, É.: The quickest transshipment problem. Mathematics of Operations Research 25, 36–62 (2000)
Minieka, E.: Maximal, lexicographic, and dynamic network flows. Operations Research 21, 517–527 (1973)
Philpott, A.B.: Continuous-time flows in networks. Mathematics of Operations Research 15(4), 640–661 (1990)
Ruzika, S., Sperber, H., Steiner, M.: Earliest arrival flows on series-parallel graphs. Networks 57(2), 169–173 (2011)
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
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)
Tjandra, S.A.: Dynamic network optimization with application to the evacuation problem. Ph.D. thesis, Technical University of Kaiserslautern (2003)
Wilkinson, W.L.: An algorithm for universal maximal dynamic flows in a network. Operations Research 19, 1602–1612 (1971)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Groß, M., Kappmeier, JP.W., Schmidt, D.R., Schmidt, M. (2012). Approximating Earliest Arrival Flows in Arbitrary Networks. In: Epstein, L., Ferragina, P. (eds) Algorithms – ESA 2012. ESA 2012. Lecture Notes in Computer Science, vol 7501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33090-2_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-33090-2_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33089-6
Online ISBN: 978-3-642-33090-2
eBook Packages: Computer ScienceComputer Science (R0)