{"article_processing_charge":"No","status":"public","author":[{"last_name":"Henzinger","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"last_name":"Leniowski","full_name":"Leniowski, Dariusz","first_name":"Dariusz"},{"full_name":"Mathieu, Claire","last_name":"Mathieu","first_name":"Claire"}],"citation":{"short":"M.H. Henzinger, D. Leniowski, C. Mathieu, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","apa":"Henzinger, M. H., Leniowski, D., &#38; Mathieu, C. (2017). Dynamic clustering to minimize the sum of radii. In <i>25th Annual European Symposium on Algorithms</i> (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.48\">https://doi.org/10.4230/LIPICS.ESA.2017.48</a>","chicago":"Henzinger, Monika H, Dariusz Leniowski, and Claire Mathieu. “Dynamic Clustering to Minimize the Sum of Radii.” In <i>25th Annual European Symposium on Algorithms</i>, Vol. 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017. <a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.48\">https://doi.org/10.4230/LIPICS.ESA.2017.48</a>.","ista":"Henzinger MH, Leniowski D, Mathieu C. 2017. Dynamic clustering to minimize the sum of radii. 25th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 87, 48.","mla":"Henzinger, Monika H., et al. “Dynamic Clustering to Minimize the Sum of Radii.” <i>25th Annual European Symposium on Algorithms</i>, vol. 87, 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.48\">10.4230/LIPICS.ESA.2017.48</a>.","ama":"Henzinger MH, Leniowski D, Mathieu C. Dynamic clustering to minimize the sum of radii. In: <i>25th Annual European Symposium on Algorithms</i>. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:<a href=\"https://doi.org/10.4230/LIPICS.ESA.2017.48\">10.4230/LIPICS.ESA.2017.48</a>","ieee":"M. H. Henzinger, D. Leniowski, and C. Mathieu, “Dynamic clustering to minimize the sum of radii,” in <i>25th Annual European Symposium on Algorithms</i>, Vienna, Austria, 2017, vol. 87."},"type":"conference","conference":{"end_date":"2017-09-06","location":"Vienna, Austria","start_date":"2017-09-04","name":"ESA: Annual European Symposium on Algorithms"},"year":"2017","date_created":"2022-08-12T09:58:46Z","extern":"1","scopus_import":"1","alternative_title":["LIPIcs"],"intvolume":"        87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa_version":"Published Version","volume":87,"day":"01","date_updated":"2023-02-16T11:54:12Z","publication_status":"published","month":"09","date_published":"2017-09-01T00:00:00Z","abstract":[{"text":"In this paper, we study the problem of opening centers to cluster a set of clients in a metric space so as to minimize the sum of the costs of the centers and of the cluster radii, in a dynamic environment where clients arrive and depart, and the solution must be updated efficiently while remaining competitive with respect to the current optimal solution. We call this dynamic sum-of-radii clustering problem.\r\n\r\nWe present a data structure that maintains a solution whose cost is within a constant factor of the cost of an optimal solution in metric spaces with bounded doubling dimension and whose worst-case update time is logarithmic in the parameters of the problem.","lang":"eng"}],"oa":1,"publication_identifier":{"isbn":["978-3-95977-049-1"],"issn":["1868-8969"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPICS.ESA.2017.48"}],"language":[{"iso":"eng"}],"article_number":"48","_id":"11832","doi":"10.4230/LIPICS.ESA.2017.48","publication":"25th Annual European Symposium on Algorithms","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1707.02577"]},"quality_controlled":"1","title":"Dynamic clustering to minimize the sum of radii"}