{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:56:45Z","timestamp":1725796605849},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_36","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"417-428","source":"Crossref","is-referenced-by-count":2,"title":["Back-Up 2-Center on a Path\/Tree\/Cycle\/Unicycle"],"prefix":"10.1007","author":[{"given":"Binay","family":"Bhattacharya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minati","family":"De","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsunehiko","family":"Kameda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sasanka","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladyslav","family":"Sokol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/11682462_19","volume-title":"LATIN 2006: Theoretical Informatics","author":"B. Ben-Moshe","year":"2006","unstructured":"Ben-Moshe, B., Bhattacharya, B., Shi, Q.: An optimal algorithm for the continuous\/Discrete weighted 2-center problem in trees. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 166\u2013177. Springer, Heidelberg (2006)"},{"issue":"3","key":"36_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.tcs.2007.02.033","volume":"378","author":"B. Ben-Moshe","year":"2007","unstructured":"Ben-Moshe, B., Bhattacharya, B., Shi, Q., Tamir, A.: Efficient algorithms for center problems in cactus networks. Theoretical Computer Science\u00a0378(3), 237\u2013252 (2007)","journal-title":"Theoretical Computer Science"},{"key":"36_CR3","unstructured":"Benkoczi, R.: Cardinality constrained facility location problems in trees. Ph.D. thesis, School of Computing Science. Simon Fraser University, Canada (2004)"},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-45138-9_16","volume-title":"Mathematical Foundations of Computer Science 2003","author":"R. Benkoczi","year":"2003","unstructured":"Benkoczi, R., Bhattacharya, B., Chrobak, M., Larmore, L.L., Rytter, W.: Faster algorithms for k-medians in trees. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 218\u2013227. Springer, Heidelberg (2003)"},{"key":"36_CR5","unstructured":"Bhattacharya, B., Kameda, T., Song, Z.: Minmax regret 1-center on a path\/cycle\/tree. In: Proc. 6th Int\u2019l Conf. on Advanced Engineering Computing and Applications in Sciences (ADVCOMP), pp. 108\u2013113 (2012), \n                    \n                      http:\/\/www.thinkmind.org\/index.php?view=article&articleid=advcomp_2012_5_20_20093"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02684332","volume":"60","author":"R. Burkard","year":"1998","unstructured":"Burkard, R., Krarup, J.: A linear algorithm for the pos\/neg-weighted 1-median problem on a cactus. Computing\u00a060, 193\u2013215 (1998)","journal-title":"Computing"},{"issue":"4","key":"36_CR7","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(nlogn) time. Information Processing Letters\u00a033(4), 169\u2013174 (1989)","journal-title":"Information Processing Letters"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2012.05.003","volume":"445","author":"Y. Hong","year":"2012","unstructured":"Hong, Y., Kang, L.: Backup 2-center on interval graphs. Theoretical Computer Science\u00a0445, 25\u201335 (2012)","journal-title":"Theoretical Computer Science"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.: An algorithmic approach to network location problems, part 1: The p-centers. SIAM J. Appl. Math.\u00a037, 513\u2013538 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.: An algorithmic approach to network location problems, part 2: The p-median. SIAM J. Appl. Math.\u00a037, 539\u2013560 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"36_CR11","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":"36_CR12","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear-programming in R\n                  3 and related problems. SIAM J. Computing\u00a012, 759\u2013776 (1983)","journal-title":"SIAM J. Computing"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1057\/jors.1972.72","volume":"23","author":"J. Rosenhead","year":"1972","unstructured":"Rosenhead, J., Elton, M., Gupta, S.K.: Robustness and optimality as criteria for strategic decisions. Operational Research Quarterly\u00a023, 413\u2013431 (1972)","journal-title":"Operational Research Quarterly"},{"key":"36_CR14","unstructured":"Shi, Q.: Efficient algorithms for network center\/covering location optimization problems. Ph.D. thesis, School of Computing Science, Simon Fraser University, Canada (2008)"},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1080\/074081791009022","volume":"38","author":"L. Snyder","year":"2006","unstructured":"Snyder, L.: Facility location under uncertainty: a review. IIE Transactions\u00a038, 537\u2013554 (2006)","journal-title":"IIE Transactions"},{"key":"36_CR16","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1287\/trsc.1040.0107","volume":"39","author":"L. Snyder","year":"2005","unstructured":"Snyder, L., Daskin, M.S.: Reliability models for facility locations: The expected failure cost case. Transportation Science\u00a039, 400\u2013416 (2005)","journal-title":"Transportation Science"},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A. Tamir","year":"1996","unstructured":"Tamir, A.: An O(pn\n                  2) algorithm for the p-median and the related problems in tree graphs. Operations Research Letters\u00a019, 59\u201364 (1996)","journal-title":"Operations Research Letters"},{"key":"36_CR18","unstructured":"Wang, H.L., Wu, B.Y., Chao, K.M.: A linear time algorithm for the backup 2-center problem on a tree. In: 24th Workshop on Combinatorial Mathematics and Computation Theory, pp. 189\u2013195 (2007)"},{"issue":"1","key":"36_CR19","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/net.20261","volume":"53","author":"H.L. Wang","year":"2009","unstructured":"Wang, H.L., Wu, B.Y., Chao, K.M.: The backup 2-center and backup 2-median problems on trees. Networks\u00a053(1), 39\u201349 (2009)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T06:33:43Z","timestamp":1558938823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}