{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T23:46:04Z","timestamp":1775000764629,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T00:00:00Z","timestamp":1601337600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T00:00:00Z","timestamp":1601337600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1615845"],"award-info":[{"award-number":["CCF-1615845"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s00453-020-00762-y","type":"journal-article","created":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T12:03:07Z","timestamp":1601380987000},"page":"413-446","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Fault-Tolerant Covering Problems in Metric Spaces"],"prefix":"10.1007","volume":"83","author":[{"given":"Santanu","family":"Bhowmick","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0184-5932","authenticated-orcid":false,"given":"Tanmay","family":"Inamdar","sequence":"additional","affiliation":[]},{"given":"Kasturi","family":"Varadarajan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,29]]},"reference":[{"issue":"6","key":"762_CR1","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1142\/S021819591100386X","volume":"21","author":"AK Abu-Affash","year":"2011","unstructured":"Abu-Affash, A.K., Carmi, P., Katz, M.J., Morgenstern, G.: Multi cover of a polygon minimizing the sum of areas. Int. J. Comput. Geom. Appl. 21(6), 685\u2013698 (2011)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"762_CR2","doi-asserted-by":"crossref","unstructured":"Alt, H., Arkin, E.M., Br\u00f6nnimann, H., Erickson, J., Fekete, S.P., Knauer, C., Lenchner, J., Mitchell, J.S.B., Whittlesey, K.: Minimum-cost coverage of point sets by disks. In: Symposium on Computational Geometry, pp. 449\u2013458 (2006)","DOI":"10.1145\/1137856.1137922"},{"key":"762_CR3","unstructured":"Bandyapadhyay, S., Varadarajan, K.R.: Approximate clustering via metric partitioning. In: Hong, S.-H. (ed.) ISAAC. LIPIcs, vol. 64, pp. 15:1\u201315:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016). ISBN 978-3-95977-026-2"},{"issue":"3","key":"762_CR4","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.comgeo.2012.10.006","volume":"46","author":"R Bar-Yehuda","year":"2013","unstructured":"Bar-Yehuda, R., Rawitz, D.: A note on multicovering with disks. Comput. Geom. 46(3), 394\u2013399 (2013)","journal-title":"Comput. Geom."},{"key":"762_CR5","doi-asserted-by":"crossref","unstructured":"Bhowmick, S., Varadarajan, K.R., Xue, S.-K.: A constant-factor approximation for multi-covering with disks. In: Symposium on Computational Geometry, pp. 243\u2013248 (2013)","DOI":"10.1145\/2462356.2462400"},{"issue":"1","key":"762_CR6","first-page":"220","volume":"6","author":"S Bhowmick","year":"2015","unstructured":"Bhowmick, S., Varadarajan, K.R., Xue, S.-K.: A constant-factor approximation for multi-covering with disks. JoCG 6(1), 220\u2013234 (2015)","journal-title":"JoCG"},{"key":"762_CR7","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Caragiannis, I., Kaklamanis, C., Kanellopoulos, P.: Geometric clustering to minimize the sum of cluster sizes. In: ESA, pp. 460\u2013471 (2005)","DOI":"10.1007\/11561071_42"},{"key":"762_CR8","doi-asserted-by":"crossref","unstructured":"Byrka, J., Aravind, S., Swamy, C.: Fault-tolerant facility location: a randomized dependent lp-rounding algorithm. In: International Conference on Integer Programming and Combinatorial Optimization, pp. 244\u2013257. Springer (2010)","DOI":"10.1007\/978-3-642-13036-6_19"},{"issue":"2","key":"762_CR9","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/j.jcss.2003.07.014","volume":"68","author":"M Charikar","year":"2004","unstructured":"Charikar, M., Panigrahy, R.: Clustering to minimize the sum of cluster diameters. J. Comput. Syst. Sci. 68(2), 417\u2013441 (2004)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"762_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0020-0190(97)00224-X","volume":"65","author":"S Chaudhuri","year":"1998","unstructured":"Chaudhuri, S., Garg, N., Ravi, R.: The p-neighbor k-center problem. Inf. Process. Lett. 65(3), 131\u2013134 (1998)","journal-title":"Inf. Process. Lett."},{"key":"762_CR11","doi-asserted-by":"crossref","unstructured":"Freund, A., Rawitz, D.: Combinatorial interpretations of dual fitting and primal fitting. In: WAOA, pp. 137\u2013150 (2003)","DOI":"10.1007\/978-3-540-24592-6_11"},{"issue":"1","key":"762_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1137\/100798144","volume":"41","author":"M Gibson","year":"2012","unstructured":"Gibson, M., Kanade, G., Krohn, E., Pirwani, I.A., Varadarajan, K.: On clustering to minimize the sum of radii. SIAM J. Comput. 41(1), 47\u201360 (2012)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"762_CR13","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/S0196-6774(03)00056-7","volume":"48","author":"S Guha","year":"2003","unstructured":"Guha, S., Meyerson, A., Munagala, K.: A constant factor approximation algorithm for the fault-tolerant facility location problem. J. Algorithms 48(2), 429\u2013440 (2003)","journal-title":"J. Algorithms"},{"issue":"3","key":"762_CR14","first-page":"36","volume":"12","author":"M Hajiaghayi","year":"2016","unstructured":"Hajiaghayi, M., Wei, H., Li, J., Li, S., Saha, B.: A constant factor approximation algorithm for fault-tolerant k-median. ACM Trans. Algorithms (TALG) 12(3), 36 (2016)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"1","key":"762_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(98)00222-9","volume":"242","author":"S Khuller","year":"2000","unstructured":"Khuller, S., Pless, R., Sussmann, Y.J.: Fault tolerant k-center problems. Theor. Comput. Sci. 242(1), 237\u2013245 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"762_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(95)00141-X","volume":"56","author":"SO Krumke","year":"1995","unstructured":"Krumke, S.O.: On a generalization of the p-center problem. Inf. Process. Lett. 56(2), 67\u201371 (1995)","journal-title":"Inf. Process. Lett."},{"key":"762_CR17","unstructured":"Kumar, N., Raichel, B.: In: Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, August 8\u201310 (2013)"},{"issue":"4","key":"762_CR18","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.comnet.2004.08.012","volume":"47","author":"N Lev-Tov","year":"2005","unstructured":"Lev-Tov, N., Peleg, D.: Polynomial time approximation schemes for base station coverage with minimum total radii. Comput. Netw. 47(4), 489\u2013501 (2005)","journal-title":"Comput. Netw."},{"issue":"4","key":"762_CR19","first-page":"51","volume":"4","author":"C Swamy","year":"2008","unstructured":"Swamy, C., Shmoys, D.B.: Fault-tolerant facility location. ACM Trans. Algorithms (TALG) 4(4), 51 (2008)","journal-title":"ACM Trans. Algorithms (TALG)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00762-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-020-00762-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-020-00762-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T00:17:23Z","timestamp":1632874643000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-020-00762-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,29]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["762"],"URL":"https:\/\/doi.org\/10.1007\/s00453-020-00762-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,29]]},"assertion":[{"value":"17 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}