{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:42Z","timestamp":1725574122408},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407706"},{"type":"electronic","value":"9783540451983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_7","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T03:32:30Z","timestamp":1294457550000},"page":"71-82","source":"Crossref","is-referenced-by-count":3,"title":["An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times"],"prefix":"10.1007","author":[{"given":"Alex","family":"Hall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katharina","family":"Langkau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"J.E. Aronson","year":"1989","unstructured":"Aronson, J.E.: A survey of dynamic network flows. Annals of Operations Research\u00a020, 1\u201366 (1989)","journal-title":"Annals of Operations Research"},{"key":"7_CR2","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. ZOR \u2014 Methods and Models of Operations Research \u00a037, 31\u201358 (1993)","journal-title":"ZOR \u2014 Methods and Models of Operations Research B"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0191-2615(99)00019-3","volume":"34","author":"M. Carey","year":"2000","unstructured":"Carey, M., Subrahmanian, E.: An approach to modelling time-varying flows on congested networks. Transportation Research B\u00a034, 157\u2013183 (2000)","journal-title":"Transportation Research B"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-47867-1_4","volume-title":"Integer Programming and Combinatorial Optimization","author":"L. Fleischer","year":"2002","unstructured":"Fleischer, L., Skutella, M.: The quickest multicommodity flow problem. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, pp. 36\u201353. Springer, Heidelberg (2002)"},{"key":"7_CR5","unstructured":"Fleischer, L., Skutella, M.: Minimum cost flows over time without intermediate storage. In: Proceedings of the 14th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, Baltimore, MD, pp. 66\u201375 (2003)"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L.R. Ford","year":"1958","unstructured":"Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Operations Research\u00a06, 419\u2013433 (1958)","journal-title":"Operations Research"},{"key":"7_CR7","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"A. Hall","year":"2003","unstructured":"Hall, A., Hippler, S., Skutella, M.: Multicommodity flows over time: Efficient algorithms and complexity. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719. Springer, Heidelberg (2003)"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"G. Handler","year":"1980","unstructured":"Handler, G., Zang, I.: A dual algorithm for the constrained shortest path problem. Networks\u00a010, 293\u2013310 (1980)","journal-title":"Networks"},{"key":"7_CR10","unstructured":"Hoppe, B.: Efficient dynamic network flow algorithms. PhD thesis, Cornell University (1995)"},{"key":"7_CR11","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, \u00c8.: The quickest transshipment problem. Mathematics of Operations Research\u00a025, 36\u201362 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/3-540-59408-6_62","volume-title":"Integer Programming and Combinatorial Optimization","author":"B. Klinz","year":"1995","unstructured":"Klinz, B., Woeginger, G.J.: Minimum cost dynamic flows: The series-parallel case. In: Balas, E., Clausen, J. (eds.) IPCO 1995. LNCS, vol.\u00a0920, pp. 329\u2013343. Springer, Heidelberg (1995)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/3-540-45749-6_53","volume-title":"Algorithms - ESA 2002","author":"E. K\u00f6hler","year":"2002","unstructured":"K\u00f6hler, E., Langkau, K., Skutella, M.: Time-expanded graphs for flow-dependent transit times. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 599\u2013611. Springer, Heidelberg (2002)"},{"key":"7_CR14","unstructured":"K\u00f6hler, E., Skutella, M.: Flows over time with load-dependent transit times. In: Proceedings of the 13th Annual ACM\u2013SIAM Symposium on Discrete Algorithms, San Francisco, CA, pp. 174\u2013183 (2002)"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N. Megiddo","year":"1979","unstructured":"Megiddo, N.: Combinatorial optimization with rational objective functions. Mathematics of Operations Research\u00a04, 414\u2013424 (1979)","journal-title":"Mathematics of Operations Research"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0927-0507(05)80107-0","volume-title":"Network Routing, ch. 3","author":"W.B. Powell","year":"1995","unstructured":"Powell, W.B., Jaillet, P., Odoni, A.: Stochastic and dynamic networks and routing. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds.) Network Routing, ch. 3. Handbooks in Operations Research and Management Science, vol.\u00a08, pp. 141\u2013295. North-Holland, Amsterdam (1995)"},{"key":"7_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-80230-0","volume-title":"Modelling Dynamic Transportation Networks","author":"B. Ran","year":"1996","unstructured":"Ran, B., Boyce, D.E.: Modelling Dynamic Transportation Networks. Springer, Berlin (1996)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45198-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T15:31:10Z","timestamp":1553355070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}