{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:21:19Z","timestamp":1742995279504,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491894"},{"type":"electronic","value":"9783031491900"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49190-0_11","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"155-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sink Location Problems in\u00a0Dynamic Flow Grid Networks"],"prefix":"10.1007","author":[{"given":"Yuya","family":"Higashikawa","sequence":"first","affiliation":[]},{"given":"Ayano","family":"Nishii","sequence":"additional","affiliation":[]},{"given":"Junichi","family":"Teruyama","sequence":"additional","affiliation":[]},{"given":"Yuki","family":"Tokuni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"11_CR1","unstructured":"Benkoczi, R., Bhattacharya, B., Higashikawa, Y., Kameda, T., Katoh, N., Teruyama, J.: Locating evacuation centers optimally in path and cycle networks. In: 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021). Open Access Series in Informatics (OASIcs), vol. 96, pp. 13:1\u201313:19 (2021)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-319-62127-2_12","volume-title":"Algorithms and Data Structures","author":"B Bhattacharya","year":"2017","unstructured":"Bhattacharya, B., Golin, M.J., Higashikawa, Y., Kameda, T., Katoh, N.: Improved algorithms for computing k-sink on dynamic flow path networks. In: WADS 2017. LNCS, vol. 10389, pp. 133\u2013144. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_12"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Busacker, R.G., Gowen, P.J.: A procedure for determining a family of minimum-cost network flow patterns. Technical report, RESEARCH ANALYSIS CORP MCLEAN VA (1960)","DOI":"10.21236\/AD0249662"},{"key":"11_CR4","unstructured":"Chen, D., Golin, M.: Sink evacuation on trees with dynamic confluent flows. In: 27th International Symposium on Algorithms and Computation (ISAAC 2016). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"3\u20135","key":"11_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0167-6377(98)00037-6","volume":"23","author":"L Fleischer","year":"1998","unstructured":"Fleischer, L., Tardos, \u00c9.: Efficient continuous-time dynamic network flow algorithms. Oper. Res. Lett. 23(3\u20135), 71\u201380 (1998)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"LR Ford Jr","year":"1958","unstructured":"Ford, L.R., Jr., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Oper. Res. 6(3), 419\u2013433 (1958)","journal-title":"Oper. Res."},{"issue":"2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02579170","volume":"6","author":"S Hart","year":"1986","unstructured":"Hart, S., Sharir, M.: Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes. Combinatorica 6(2), 151\u2013177 (1986)","journal-title":"Combinatorica"},{"issue":"4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","volume":"33","author":"J Hershberger","year":"1989","unstructured":"Hershberger, J.: Finding the upper envelope of $$n$$ line segments in $${O}(n \\log n)$$ time. Inf. Process. Lett. 33(4), 169\u2013174 (1989)","journal-title":"Inf. Process. Lett."},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-04657-0_14","volume-title":"Algorithms and Computation","author":"Y Higashikawa","year":"2014","unstructured":"Higashikawa, Y., Golin, M.J., Katoh, N.: Minimax regret sink location problem in dynamic tree networks with uniform capacity. In: Pal, S.P., Sadakane, K. (eds.) WALCOM 2014. LNCS, vol. 8344, pp. 125\u2013137. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04657-0_14"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2015.05.053","volume":"607","author":"Y Higashikawa","year":"2015","unstructured":"Higashikawa, Y., Golin, M.J., Katoh, N.: Multiple sink location problems in dynamic path networks. Theoret. Comput. Sci. 607, 2\u201315 (2015)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s12626-019-00047-z","volume":"13","author":"Y Higashikawa","year":"2019","unstructured":"Higashikawa, Y., Katoh, N.: A survey on facility location problems in dynamic flow networks. Rev. Socionetw. Strateg. 13(2), 163\u2013208 (2019)","journal-title":"Rev. Socionetw. Strateg."},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Higashikawa, Y., Nishii, A., Teruyama, J., Tokuni, Y.: Sink location problems in dynamic flow grid networks. arXiv e-prints arXiv:2308.12651 (2023). https:\/\/doi.org\/10.48550\/arXiv.2308.12651","DOI":"10.48550\/arXiv.2308.12651"},{"issue":"1","key":"11_CR13","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. Math. Oper. Res. 25(1), 36\u201362 (2000)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"11_CR14","first-page":"2","volume":"3","author":"M Iri","year":"1960","unstructured":"Iri, M.: A new method of solving transportation-network problems. J. Oper. Res. Soc. Jpn. 3(1), 2 (1960)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"11_CR15","unstructured":"Jewell, W.S.: Optimal flow through networks. In: Operations Research, vol. 6, pp. 633\u2013633 (1958)"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.tcs.2019.08.004","volume":"795","author":"N Kamiyama","year":"2019","unstructured":"Kamiyama, N.: Discrete newton methods for the evacuation problem. Theoret. Comput. Sci. 795, 510\u2013519 (2019)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR17","first-page":"104","volume":"45","author":"K Kinjo","year":"2011","unstructured":"Kinjo, K., Matsumoto, M.: An analysis of the impact of individuals and society to evacuation based on the Great East Japan Earthquake survey (in Japanese). Jpn. Soc. Urbanol. Annu. Rep. 45, 104\u2013112 (2011)","journal-title":"Jpn. Soc. Urbanol. Annu. Rep."},{"issue":"16","key":"11_CR18","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 \\log ^2 n)$$ algorithm for the optimal sink location problem in dynamic tree networks. Discret. Appl. Math. 154(16), 2387\u20132401 (2006)","journal-title":"Discret. Appl. Math."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Schl\u00f6ter, M., Skutella, M., Van Tran, K.: A faster algorithm for quickest transshipments via an extended discrete Newton method. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 90\u2013102. SIAM (2022)","DOI":"10.1137\/1.9781611977073.5"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49190-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:08:57Z","timestamp":1702026537000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49190-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491894","9783031491900"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49190-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}