{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:42:22Z","timestamp":1743057742619,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_12","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"146-160","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Algorithms for Computing Minmax Regret 1-Sink and 2-Sink on Path Network"],"prefix":"10.1007","author":[{"given":"Binay","family":"Bhattacharya","sequence":"first","affiliation":[]},{"given":"Tsunehiko","family":"Kameda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"12_CR1","unstructured":"Arumugam, G.P., Augustine, J., Golin, M., Srikanthan, P.: A polynomial time algorithm for minimax-regret evacuation on a dynamic path. arXiv:1404,5448v1 [cs.DS] 22 April 2014 165 (2014)"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/978-3-642-54423-1_29","volume-title":"LATIN 2014: Theoretical Informatics","author":"B Bhattacharya","year":"2014","unstructured":"Bhattacharya, B., Kameda, T., Song, Z.: Improved minmax regret 1-center algorithms for cactus networks with c cycles. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 330\u2013341. Springer, Heidelberg (2014)"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/s00453-013-9851-7","volume":"70","author":"B Bhattacharya","year":"2014","unstructured":"Bhattacharya, B., Kameda, T., Song, Z.: Linear time algorithm for finding minmax regret 1-median on a tree with positive vertex weights. Algorithmica 70, 2\u201321 (2014)","journal-title":"Algorithmica"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"12_CR5","first-page":"227","volume-title":"Pedestrian and Evacuation Dynamics","author":"H Hamacher","year":"2002","unstructured":"Hamacher, H., Tjandra, S.: Mathematical modelling of evacuation problems: a state of the art. In: Schreckenberg, M., Sharma, S.D. (eds.) Pedestrian and Evacuation Dynamics, pp. 227\u2013266. Springer, Heidelberg (2002)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Higashikawa, Y., Augustine, J., Cheng, S.W., Golin, M.J., Katoh, N., Ni, G., Su, B., Xu, Y.: Minimax regret 1-sink location problem in dynamic path networks. Theor. Comput. Sci. 31(2) (2014)","DOI":"10.1007\/s10878-014-9716-2"},{"key":"12_CR7","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, Heidelberg (2014)"},{"key":"12_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust Discrete Optimization and its Applications","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust Discrete Optimization and its Applications. Kluwer Academic Publishers, London (1997)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Li, H., Xu, Y., Ni, G.: Minimax regret 2-sink location problem in dynamic path networks. J. Comb. Optim. (2014)","DOI":"10.1007\/s10878-014-9716-2"},{"key":"12_CR10","first-page":"1020","volume":"E85\u2013A","author":"S Mamada","year":"2002","unstructured":"Mamada, S., Makino, K., Fujishige, S.: Optimal sink location problem for dynamic flows in a tree network. IEICE Trans. Fundam. E85\u2013A, 1020\u20131025 (2002)","journal-title":"IEICE Trans. Fundam."},{"key":"12_CR11","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 a sink location problem in dynamic tree networks. Discrete Appl. Math. 154, 2387\u20132401 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.ejor.2014.06.026","volume":"239","author":"H Wang","year":"2014","unstructured":"Wang, H.: Minmax regret 1-facility location on uncertain path networks. Eur. J. Oper. Res. 239(3), 636\u2013643 (2014)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T19:04:16Z","timestamp":1676660656000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}