{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:03Z","timestamp":1759639023488},"publisher-location":"Boston","reference-count":16,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"1402081405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-4020-8141-3_21","type":"book-chapter","created":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T15:15:11Z","timestamp":1140534911000},"page":"251-264","source":"Crossref","is-referenced-by-count":5,"title":["An O(n log2 n) Algorithm for a Sink Location Problem in Dynamic Tree Networks"],"prefix":"10.1007","author":[{"given":"Satoko","family":"Mamada","sequence":"first","affiliation":[]},{"given":"Takeaki","family":"Uno","sequence":"additional","affiliation":[]},{"given":"Kazuhisa","family":"Makino","sequence":"additional","affiliation":[]},{"given":"Satoru","family":"Fujishige","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1006\/jagm.2001.1203","volume":"42","author":"K. Arata","year":"2002","unstructured":"K. Arata, S. Iwata, K Makino and S. Fujishige: Locating sources to meet flow demands in undirected networks, Journal of Algorithms, 42 (2002) 54\u201368.","journal-title":"Journal of Algorithms"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"J. E. Aronson","year":"1989","unstructured":"J. E. Aronson: A survey of dynamic network flows, Annals of OR\n                  20 (1989) 1\u201366.","journal-title":"Annals of OR"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.28.1.86","volume":"28","author":"L. G. Chalmet","year":"1982","unstructured":"L. G. Chalmet, R. L. Francis and P. B. Saunders: Network models for building evacuation. Management Science, 28 (1982) 86\u2013105.","journal-title":"Management Science"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"L. Fleischer","year":"1998","unstructured":"L. Fleischer and E. Tardos: Efficient continuous-time dynamic network flow algorithms. Operations Research Letters, 23 (1998) 71\u201380.","journal-title":"Operations Research Letters"},{"key":"21_CR5","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"L. R. Ford Jr.","year":"1958","unstructured":"L. R. Ford, Jr. and D. R. Fulkerson: Constructing maximal dynamic flows from static flows, Op. Res., 6 (1958) 419\u2013433.","journal-title":"Op. Res."},{"key":"21_CR6","volume-title":"Flows in Network","author":"L. R. Ford Jr.","year":"1962","unstructured":"L. R. Ford Jr., and D. R. Fulkerson: Flows in Network (Princeton University Press, Princeton, NJ, 1962)."},{"key":"21_CR7","unstructured":"H. W. Hamacher and S. A. Tjandra: Mathematical modelling of evacuation problems: A state of the art, In: Pedestrian and Evacuation Dynamics, Springer (2002) 227\u2013266"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.25.1.36.15211","volume":"25","author":"B. Hoppe","year":"2000","unstructured":"B. Hoppe and \u00c9. Tardos: The quickest transshipment problems, Mathematics of Operations Research, 25 (2000) 36\u201362.","journal-title":"Mathematics of Operations Research"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1145\/502090.502096","volume":"48","author":"S. Iwata","year":"2001","unstructured":"S. Iwata, L. Fleischer, and S. Fujishige: A combinatorial strongly polynomial algorithm for minimizing submodular functions, Journal of the ACM\n                  48 (2001) 761\u2013777.","journal-title":"Journal of the ACM"},{"key":"21_CR10","first-page":"704","volume":"E83-A","author":"H. Ito","year":"2000","unstructured":"H. Ito, H. Uehara and M. Yokoyama: A faster and flexible algorithm for a location problem on undirected flow networks, IEICE Trans. Fundamentals, E83-A (2000) 704\u2013712.","journal-title":"IEICE Trans. Fundamentals"},{"key":"21_CR11","first-page":"1020","volume":"E85-A","author":"S. Mamada","year":"2002","unstructured":"S. Mamada, K. Makino and S. Fujishige: Optimal sink location problem for dynamic flows in a tree network, IEICE Trans. Fundamentals, E85-A (2002) 1020\u20131025.","journal-title":"IEICE Trans. Fundamentals"},{"key":"21_CR12","unstructured":"S. Mamada, K. Makino, and S. Fujishige: An evacuation problem in tree dynamic networks with multiple exits, Working paper."},{"key":"21_CR13","unstructured":"P. B. Mirchandani and R. L. Francis: Discrete Location Theory (John Wile & Sons Inc., 1989)."},{"key":"21_CR14","first-page":"141","volume-title":"Network Routing, Handbooks in Operations Research and Management Science","author":"W. B. Powell","year":"1995","unstructured":"W. B. Powell, P. Jaillet, and A. Odoni: Stochastic and dynamic networks and routing, In: Network Routing, Handbooks in Operations Research and Management Science\n                  8 (M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, eds, North-Holland, Amsterdam, The Netherlands, 1995), Chapter 3, 141\u2013295."},{"key":"21_CR15","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1006\/jctb.2000.1989","volume":"B80","author":"A. Schrijver","year":"2000","unstructured":"A. Schrijver: A combinatorial algorithm minimizing submodular functions in strongly polynomial time, J. Combinatorial Theory, B80 (2000) 346\u2013355.","journal-title":"J. Combinatorial Theory"},{"key":"21_CR16","first-page":"678","volume":"E75-A","author":"H. Tamura","year":"1992","unstructured":"H. Tamura, M. Sengoku, S. Shinoda, and T. Abe: Some covering problems in location theory on flow networks, IEICE Trans.\n                  E75-A (1992) 678\u2013683.","journal-title":"IEICE Trans."}],"container-title":["IFIP International Federation for Information Processing","Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-8141-3_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:28:12Z","timestamp":1619555292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-8141-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402081405"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/1-4020-8141-3_21","relation":{},"subject":[]}}