{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:18:43Z","timestamp":1725862723519},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319445427"},{"type":"electronic","value":"9783319445434"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44543-4_10","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T11:49:58Z","timestamp":1470656998000},"page":"122-134","source":"Crossref","is-referenced-by-count":0,"title":["Minimax Regret 1-Median Problem in Dynamic Path Networks"],"prefix":"10.1007","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":[[2016,8,9]]},"reference":[{"key":"10_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 abs\/1404.5448 . arXiv:1404.5448"},{"issue":"2","key":"10_CR2","doi-asserted-by":"crossref","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":"10_CR3","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Computing and Combinatorics","author":"B Bhattacharya","year":"2012","unstructured":"Bhattacharya, B., Kameda, T.: A linear time algorithm for computing minmax regret 1-median on a tree. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 1\u201312. Springer, Heidelberg (2012)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","first-page":"146","volume-title":"Combinatorial Optimization and Applications","author":"B Bhattacharya","year":"2014","unstructured":"Bhattacharya, B., Kameda, T.: Improved algorithms for computing minmax regret 1-sink and 2-sink on path network. In: Zhang, Z., Wu, L., Xu, W., Du, D.-Z. (eds.) COCOA 2014. LNCS, vol. 8881, pp. 146\u2013160. Springer, Heidelberg (2014)"},{"key":"10_CR5","first-page":"1","volume":"62","author":"B Bhattacharya","year":"2013","unstructured":"Bhattacharya, B., Kameda, T., Song, Z.: A linear time algorithm for computing minmax regret $$1$$ -median on a tree network. Algorithmica 62, 1\u201320 (2013)","journal-title":"Algorithmica"},{"issue":"1","key":"10_CR6","doi-asserted-by":"crossref","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":"10_CR7","doi-asserted-by":"crossref","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":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-3-642-38236-9_12","volume-title":"Theory and Applications of Models of Computation","author":"S-W Cheng","year":"2013","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: Chan, T.-H.H., Lau, L.C., Trevisan, L. (eds.) TAMC 2013. LNCS, vol. 7876, pp. 121\u2013132. Springer, Heidelberg (2013)"},{"issue":"2","key":"10_CR9","doi-asserted-by":"crossref","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":"10_CR10","doi-asserted-by":"crossref","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":"10_CR11","doi-asserted-by":"crossref","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":"10_CR12","unstructured":"Higashikawa, Y.: Studies on the Space Exploration and the Sink Location under Incomplete Information towards Applications to Evacuation Planning. Doctoral Dissertation, Kyoto University (2014)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.tcs.2014.02.010","volume":"588","author":"Y Higashikawa","year":"2015","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. Theor. Comput. Sci. 588, 24\u201336 (2015). doi: 10.1016\/j.tcs.2014.02.010","journal-title":"Theor. Comput. Sci."},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, Heidelberg (2014)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-3-319-07956-1_14","volume-title":"Algorithmic Aspects in Information and Management","author":"Y Higashikawa","year":"2014","unstructured":"Higashikawa, Y., Golin, M.J., Katoh, N.: Multiple sink location problems in dynamic path networks. In: Gu, Q., Hell, P., Yang, B. (eds.) AAIM 2014. LNCS, vol. 8546, pp. 149\u2013161. Springer, Heidelberg (2014)"},{"issue":"4","key":"10_CR16","doi-asserted-by":"crossref","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 Algorithms Appl. 18(4), 539\u2013555 (2014)","journal-title":"J. Graph Algorithms Appl."},{"issue":"Part 1","key":"10_CR17","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. Theor. Comput. Sci. 607(Part 1), 2\u201315 (2015). doi: 10.1016\/j.tcs.2015.05.053","journal-title":"Theor. Comput. Sci."},{"issue":"16","key":"10_CR18","doi-asserted-by":"crossref","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. Discrete Appl. Math. 154(16), 2387\u20132401 (2006)","journal-title":"Discrete Appl. Math."},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1007\/978-3-642-45030-3_68","volume-title":"Algorithms and Computation","author":"H Wang","year":"2013","unstructured":"Wang, H.: Minmax regret 1-facility location on uncertain path networks. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol. 8283, pp. 733\u2013743. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44543-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T20:11:12Z","timestamp":1498335072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44543-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319445427","9783319445434"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44543-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}