{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:43:40Z","timestamp":1725515020375},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540728689"},{"type":"electronic","value":"9783540728702"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72870-2_17","type":"book-chapter","created":{"date-parts":[[2007,6,25]],"date-time":"2007-06-25T12:53:10Z","timestamp":1182775990000},"page":"178-190","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths"],"prefix":"10.1007","author":[{"given":"Naoyuki","family":"Kamiyama","sequence":"first","affiliation":[]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[]},{"given":"Atsushi","family":"Takizawa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"17_CR1","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(1), 36\u201362 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/11775096_22","volume-title":"Algorithmic Aspects in Information and Management","author":"N. Kamiyama","year":"2006","unstructured":"Kamiyama, N., Katoh, N., Takizawa, A.: An efficient algorithm for evacuation problems in dynamic network flows with uniform arc capacity. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol.\u00a04041, pp. 231\u2013242. Springer, Heidelberg (2006)"},{"key":"17_CR3","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)"},{"issue":"16","key":"17_CR4","doi-asserted-by":"publisher","first-page":"2387","DOI":"10.1016\/j.dam.2006.04.010","volume":"154","author":"S. Mamada","year":"2006","unstructured":"Mamada, S., Uno, T., Makino, K., Fujishige, S.: An O(n log2\n                    n) algorithm for the optimal sink location problem in dynamic tree networks. Discrete Applied Mathematics\u00a0154(16), 2387\u20132401 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/3-540-45061-0_33","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, pp. 397\u2013409. Springer, Heidelberg (2003)"},{"key":"17_CR6","first-page":"144","volume-title":"Resource Allocation Problems : Algorithmic Approaches","author":"T. Ibaraki","year":"1988","unstructured":"Ibaraki, T., Katoh, N.: Resource allocation problems under submodular constraints. In: Resource Allocation Problems: Algorithmic Approaches, pp. 144\u2013176. MIT Press, Cambridge (1988)"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1137\/0218003","volume":"18","author":"G. Gallo","year":"1989","unstructured":"Gallo, G., Grigoriadis, M.D., Tarjan, R.E.: A fast parametric maximum flow algorithm and applications. SIAM J. Comput.\u00a018(1), 30\u201355 (1989)","journal-title":"SIAM J. Comput."},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1142\/9789814354363_0016","volume-title":"Complexity in Numerical Optimization","author":"T. Radzik","year":"1993","unstructured":"Radzik, T.: Parametric flows, weighted means of cuts, and fractional combinatorial optimization. In: Pardalos, P.M. (ed.) Complexity in Numerical Optimization, pp. 351\u2013386. World Scientific, River Edge (1993)"},{"unstructured":"Kamiyama, N., Katoh, N., Takizawa, A.: Generalization of theorem of Edmonds. In: Proc. KyotoCGGT2007, submitted (2007)","key":"17_CR9"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72870-2_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:07:12Z","timestamp":1605762432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72870-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540728689","9783540728702"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72870-2_17","relation":{},"subject":[]}}