{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T03:03:09Z","timestamp":1761102189146,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T00:00:00Z","timestamp":1445212800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan (TW)","doi-asserted-by":"publisher","award":["103-2221-E-141-004"],"award-info":[{"award-number":["103-2221-E-141-004"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s00453-015-0081-z","type":"journal-article","created":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T10:14:33Z","timestamp":1445249673000},"page":"426-439","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Optimal Algorithm for the Weighted Backup 2-Center Problem on a Tree"],"prefix":"10.1007","volume":"77","author":[{"given":"Hung-Lung","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,19]]},"reference":[{"key":"81_CR1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.ejor.2009.02.022","volume":"201","author":"M Albareda-Sambola","year":"2010","unstructured":"Albareda-Sambola, M., D\u00edaz, J.A., Fern\u00e1ndez, E.: Lagrangean duals and exact solution to the capacitated $$p$$ p -center problem. Eur. J. Oper. Res. 201, 71\u201381 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"81_CR2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0966-8349(98)00033-3","volume":"5","author":"I Averbakh","year":"1997","unstructured":"Averbakh, I., Berman, O.: Minimax regret $$p$$ p -center location on a network with demand uncertainty. Locat. Sci. 5, 247\u2013254 (1997)","journal-title":"Locat. Sci."},{"key":"81_CR3","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, 292\u2013302 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"81_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Moshe, B., Bhattacharya, B., Shi, Q.: An optimal algorithm for the continuous\/discrete weighted 2-center problem in trees. In: Proceedings of the 7th Latin American Symposium on Theoretical Informatics (LNCS 3887), Valdivia, Chile, pp. 166\u2013177 (2006)","DOI":"10.1007\/11682462_19"},{"key":"81_CR5","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 378, 237\u2013252 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"81_CR6","doi-asserted-by":"crossref","unstructured":"Bhattacharya, B., De, M., Kameda, T., Roy, S., Sokol, V., Song, Z.: Back-up 2-center on a path\/tree\/cycle\/unicycle. In: Procedings of the 20th International Conference on Computing and Combinatorics (LNCS 8591), Atlanta, GA, USA, pp. 417\u2013428 (2014)","DOI":"10.1007\/978-3-319-08783-2_36"},{"key":"81_CR7","doi-asserted-by":"crossref","unstructured":"Frederickson, G. N.: Parametric search and locating supply centers in trees. In: Proceedings of the 2nd Workshop on Algorithms and Data Structures (LNCS 519), Ottawa, Canada, pp. 299\u2013319 (1991)","DOI":"10.1007\/BFb0028271"},{"key":"81_CR8","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 445, 25\u201335 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"81_CR9","first-page":"441","volume":"37","author":"O Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, Part I. The $$p$$ p -centers. SIAM J. Appl. Math. 37, 441\u2013461 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"81_CR10","doi-asserted-by":"crossref","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^3$$ R 3 and related problems. SIAM J. Comput. 12, 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"key":"81_CR11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0166-218X(87)90029-1","volume":"17","author":"J Plesn\u00edk","year":"1987","unstructured":"Plesn\u00edk, J.: A heuristic for the $$p$$ p -center problem in graphs. Discrete Appl. Math. 17, 263\u2013268 (1987)","journal-title":"Discrete Appl. Math."},{"key":"81_CR12","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1080\/074081791009022","volume":"38","author":"LV Snyder","year":"2006","unstructured":"Snyder, L.V.: Facility location under uncertainty: a review. IIE Trans. 38, 537\u2013554 (2006)","journal-title":"IIE Trans."},{"key":"81_CR13","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1287\/trsc.1040.0107","volume":"39","author":"LV Snyder","year":"2005","unstructured":"Snyder, L.V., Daskin, M.S.: Reliability models for facility location: the expected failure cost case. Transp. Sci. 39, 400\u2013416 (2005)","journal-title":"Transp. Sci."},{"key":"81_CR14","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.orl.2003.10.004","volume":"32","author":"A Tamir","year":"2004","unstructured":"Tamir, A.: Sorting weighted distances with applications to objective function evaluations in single facility location problems. Oper. Res. Lett. 32, 249\u2013257 (2004)","journal-title":"Oper. Res. Lett."},{"key":"81_CR15","doi-asserted-by":"crossref","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 53, 39\u201349 (2009)","journal-title":"Networks"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0081-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0081-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0081-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0081-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T14:09:24Z","timestamp":1567260564000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0081-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,19]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["81"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0081-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2015,10,19]]}}}