{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:02:42Z","timestamp":1740096162615,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_48","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"551-562","source":"Crossref","is-referenced-by-count":8,"title":["Approximating Earliest Arrival Flows in Arbitrary Networks"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gro\u00df","sequence":"first","affiliation":[]},{"given":"Jan-Philipp W.","family":"Kappmeier","sequence":"additional","affiliation":[]},{"given":"Daniel R.","family":"Schmidt","sequence":"additional","affiliation":[]},{"given":"Melanie","family":"Schmidt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"48_CR1","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1287\/moor.1090.0382","volume":"34","author":"N. Baumann","year":"2009","unstructured":"Baumann, N., Skutella, M.: Solving evacuation problems efficiently: Earliest arrival flows with multiple sources. Mathematics of Operations Research\u00a034(2), 499\u2013512 (2009)","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"48_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/j.dam.2006.04.030","volume":"155","author":"N. Baumann","year":"2007","unstructured":"Baumann, N., K\u00f6hler, E.: Approximating earliest arrival flows with flow-dependent transit times. Discrete Applied Mathematics\u00a0155(2), 161\u2013171 (2007)","journal-title":"Discrete Applied Mathematics"},{"key":"48_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01415527","volume":"37","author":"R.E. Burkard","year":"1993","unstructured":"Burkard, R.E., Dlaska, K., Klinz, B.: The quickest flow problem. Mathematical Methods of Operations Research\u00a037, 31\u201358 (1993)","journal-title":"Mathematical Methods of Operations Research"},{"issue":"1","key":"48_CR4","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1137\/S1052623497327295","volume":"12","author":"L.K. Fleischer","year":"2001","unstructured":"Fleischer, L.K.: Faster algorithms for the quickest transshipment problem. SIAM Journal on Optimization\u00a012(1), 18\u201335 (2001)","journal-title":"SIAM Journal on Optimization"},{"issue":"6","key":"48_CR5","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1137\/S0097539703427215","volume":"36","author":"L.K. Fleischer","year":"2007","unstructured":"Fleischer, L.K., Skutella, M.: Quickest flows over time. SIAM Journal on Computing\u00a036(6), 1600\u20131630 (2007)","journal-title":"SIAM Journal on Computing"},{"issue":"3-5","key":"48_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"L.K. Fleischer","year":"1998","unstructured":"Fleischer, L.K., Tardos, \u00c9.: Efficient continuous-time dynamic network flow algorithms. Operations Research Letters\u00a023(3-5), 71\u201380 (1998)","journal-title":"Operations Research Letters"},{"key":"48_CR7","doi-asserted-by":"crossref","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press (1962)","DOI":"10.1515\/9781400875184"},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1307\/mmj\/1028998140","volume":"6","author":"D. Gale","year":"1959","unstructured":"Gale, D.: Transient flows in networks. Michigan Mathematical Journal\u00a06, 59\u201363 (1959)","journal-title":"Michigan Mathematical Journal"},{"key":"48_CR9","unstructured":"Gro\u00df, M., Skutella, M.: Generalized maximum flows over time. In: Proceedings of the 9th WAOA, pp. 247\u2013260 (to appear, 2012)"},{"key":"48_CR10","unstructured":"Hoppe, B.: Efficient dynamic network flow algorithms. Ph.D. thesis, Cornell University (1995)"},{"key":"48_CR11","unstructured":"Hoppe, B., Tardos, \u00c9.: Polynomial time algorithms for some evacuation problems. In: Proceedings of the 5th SODA, pp. 433\u2013441 (1994)"},{"key":"48_CR12","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.25.1.36.15211","volume":"25","author":"B. Hoppe","year":"2000","unstructured":"Hoppe, B., Tardos, \u00c9.: The quickest transshipment problem. Mathematics of Operations Research\u00a025, 36\u201362 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"48_CR13","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1287\/opre.21.2.517","volume":"21","author":"E. Minieka","year":"1973","unstructured":"Minieka, E.: Maximal, lexicographic, and dynamic network flows. Operations Research\u00a021, 517\u2013527 (1973)","journal-title":"Operations Research"},{"issue":"4","key":"48_CR14","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1287\/moor.15.4.640","volume":"15","author":"A.B. Philpott","year":"1990","unstructured":"Philpott, A.B.: Continuous-time flows in networks. Mathematics of Operations Research\u00a015(4), 640\u2013661 (1990)","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"48_CR15","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/net.20398","volume":"57","author":"S. Ruzika","year":"2011","unstructured":"Ruzika, S., Sperber, H., Steiner, M.: Earliest arrival flows on series-parallel graphs. Networks\u00a057(2), 169\u2013173 (2011)","journal-title":"Networks"},{"key":"48_CR16","doi-asserted-by":"crossref","unstructured":"Schmidt, M., Skutella, M.: Earliest arrival flows in networks with multiple sinks. Discrete Applied Mathematics (2011), \n                  \n                    http:\/\/dx.doi.org\/10.1016\/j.dam.2011.09.023","DOI":"10.1016\/j.dam.2011.09.023"},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"Skutella, M.: An introduction to network flows over time. In: Cook, W., Lov\u00e1sz, L., Vygen, J. (eds.) Research Trends in Combinatorial Optimization, pp. 451\u2013482. Springer (2009)","DOI":"10.1007\/978-3-540-76796-1_21"},{"key":"48_CR18","unstructured":"Tjandra, S.A.: Dynamic network optimization with application to the evacuation problem. Ph.D. thesis, Technical University of Kaiserslautern (2003)"},{"key":"48_CR19","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1287\/opre.19.7.1602","volume":"19","author":"W.L. Wilkinson","year":"1971","unstructured":"Wilkinson, W.L.: An algorithm for universal maximal dynamic flows in a network. Operations Research\u00a019, 1602\u20131612 (1971)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_48.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:54:59Z","timestamp":1620129299000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}