{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T08:59:11Z","timestamp":1772614751232,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T00:00:00Z","timestamp":1495843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T00:00:00Z","timestamp":1495843200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["17K12641"],"award-info":[{"award-number":["17K12641"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003382","name":"Core Research for Evolutional Science and Technology","doi-asserted-by":"publisher","award":["JPMJCR1402"],"award-info":[{"award-number":["JPMJCR1402"]}],"id":[{"id":"10.13039\/501100003382","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s00224-017-9783-8","type":"journal-article","created":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T05:26:15Z","timestamp":1495862775000},"page":"1392-1408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Minimax Regret 1-Median Problem in Dynamic Path Networks"],"prefix":"10.1007","volume":"62","author":[{"given":"Yuya","family":"Higashikawa","sequence":"first","affiliation":[]},{"given":"Siu-Wing","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Tsunehiko","family":"Kameda","sequence":"additional","affiliation":[]},{"given":"Naoki","family":"Katoh","sequence":"additional","affiliation":[]},{"given":"Shun","family":"Saburi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,27]]},"reference":[{"key":"9783_CR1","unstructured":"Arumugam, G.P., Augustine, J., Golin, M.J., Srikanthan, P.: A polynomial time algorithm for minimax-regret evacuation on a dynamic path, CoRR, arXiv:\n                    1404.5448"},{"issue":"2","key":"9783_CR2","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/S0377-2217(99)00257-X","volume":"123","author":"I Averbakh","year":"2000","unstructured":"Averbakh, I., Berman, O.: Algorithms for the robust 1-center problem on a tree. Eur. J. Oper. Res. 123(2), 292\u2013302 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"9783_CR3","doi-asserted-by":"crossref","unstructured":"Bhattacharya, B., Kameda, T.: A linear time algorithm for computing minmax regret 1-median on a tree. In: Proceedings of the 18th Annual International Computing and Combinatorics Conference (COCOON 2012), LNCS 7434, pp. 1\u201312 (2012)","DOI":"10.1007\/978-3-642-32241-9_1"},{"key":"9783_CR4","doi-asserted-by":"crossref","unstructured":"Bhattacharya, B., Kameda, T.: Improved algorithms for computing minmax regret 1-sink and 2-sink on path network. In: Proceedings of the 8th Combinatorial Optimization and Applications (COCOA 2014), LNCS 8881, pp. 146\u2013160 (2014)","DOI":"10.1007\/978-3-319-12691-3_12"},{"key":"9783_CR5","doi-asserted-by":"crossref","unstructured":"Bhattacharya, B., Kameda, T., Song, Z.: A linear time algorithm for computing minmax regret 1-median on a tree network. Algorithmica , 1\u201320 (2013)","DOI":"10.1007\/978-3-642-32241-9_1"},{"issue":"1","key":"9783_CR6","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.orl.2007.02.012","volume":"36","author":"GS Brodal","year":"2008","unstructured":"Brodal, G.S., Georgiadis, L., Katriel, I.: An O(n log n) version of the Averbakh-Berman algorithm for the robust median of a tree. Oper. Res. Lett. 36(1), 14\u201318 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"9783_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1002\/(SICI)1097-0037(199803)31:2<93::AID-NET4>3.0.CO;2-E","volume":"31","author":"B Chen","year":"1998","unstructured":"Chen, B., Lin, C.: Minmax-regret robust 1-median location on a tree. Networks 31(2), 93\u2013103 (1998)","journal-title":"Networks"},{"key":"9783_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, S.W., Higashikawa, Y., Katoh, N., Ni, G., Su, B., Xu, Y.: Minimax regret 1-sink location problems in dynamic path networks. In: Proceedings of the 10th Annual Conference on Theory and Applications of Models of Computation (TAMC 2013), LNCS 7876, pp. 121\u2013132 (2013)","DOI":"10.1007\/978-3-642-38236-9_12"},{"issue":"2","key":"9783_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.orl.2007.05.009","volume":"36","author":"E Conde","year":"2008","unstructured":"Conde, E.: A note on the minmax regret centdian location on trees. Oper. Res. Lett. 36(2), 271\u2013275 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"9783_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1137\/0213003","volume":"13","author":"ME Dyer","year":"1984","unstructured":"Dyer, M.E.: Linear time algorithms for two- and three-variable linear programs. SIAM J. Comput. 13(1), 31\u201345 (1984)","journal-title":"SIAM J. Comput."},{"key":"9783_CR11","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/opre.6.3.419","volume":"6","author":"LR Ford Jr","year":"1958","unstructured":"Ford, Jr.L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Oper. Res. 6, 419\u2013433 (1958)","journal-title":"Oper. Res."},{"key":"9783_CR12","volume-title":"Studies on the Space Exploration and the Sink Location under Incomplete Information towards Applications to Evacuation Planning, Doctoral Dissertation","author":"Y Higashikawa","year":"2014","unstructured":"Higashikawa, Y.: Studies on the Space Exploration and the Sink Location under Incomplete Information towards Applications to Evacuation Planning, Doctoral Dissertation. Kyoto University, Japan (2014)"},{"key":"9783_CR13","doi-asserted-by":"publisher","unstructured":"Higashikawa, Y., Augustine, J., Cheng, S.W., Katoh, N., Ni, G., Su, B., Xu, Y.: Minimax Regret 1-Sink Location Problem in Dynamic Path Networks. Theoretical Computer Science, doi:\n                    10.1016\/j.tcs.2014.02.010\n                    \n                   (2014)","DOI":"10.1016\/j.tcs.2014.02.010"},{"key":"9783_CR14","doi-asserted-by":"crossref","unstructured":"Higashikawa, Y., Golin, M.J., Katoh, N.: Minimax regret sink location problem in dynamic tree networks with uniform capacity. In: Proceedings of the 8th International Workshop on Algorithms and Computation (WALCOM 2014), LNCS 8344, pp. 125\u2013137 (2014)","DOI":"10.1007\/978-3-319-04657-0_14"},{"key":"9783_CR15","doi-asserted-by":"crossref","unstructured":"Higashikawa, Y., Golin, M.J., Katoh, N.: Multiple sink location problems in dynamic path networks. In: Proceedings of the 10th International Conference on Algorithmic Aspects of Information and Management (AAIM 2014), LNCS 8546, pp. 149\u2013161 (2014)","DOI":"10.1007\/978-3-319-07956-1_14"},{"issue":"4","key":"9783_CR16","doi-asserted-by":"publisher","first-page":"539","DOI":"10.7155\/jgaa.00336","volume":"18","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. J. Graph Algorithm. Appl. 18(4), 539\u2013555 (2014)","journal-title":"J. Graph Algorithm. Appl."},{"key":"9783_CR17","doi-asserted-by":"publisher","unstructured":"Higashikawa, Y., Golin, M.J., Katoh, N.: Multiple sink location problems in dynamic path networks. Theoretical Computer Science, doi:\n                    10.1016\/j.tcs.2015.05.053","DOI":"10.1016\/j.tcs.2015.05.053"},{"issue":"16","key":"9783_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 log2 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":"9783_CR19","doi-asserted-by":"crossref","unstructured":"Wang, H.: Minmax regret 1-facility location on uncertain path networks. In: Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC 2013), LNCS 8283, pp. 733\u2013743 (2013)","DOI":"10.1007\/978-3-642-45030-3_68"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-017-9783-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9783-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-017-9783-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T05:37:12Z","timestamp":1589693832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-017-9783-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,27]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["9783"],"URL":"https:\/\/doi.org\/10.1007\/s00224-017-9783-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,27]]},"assertion":[{"value":"27 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}