{"month":"09","date_updated":"2023-02-16T11:54:12Z","title":"Dynamic clustering to minimize the sum of radii","article_processing_charge":"No","scopus_import":"1","article_number":"48","date_created":"2022-08-12T09:58:46Z","citation":{"short":"M.H. Henzinger, D. Leniowski, C. Mathieu, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.","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.","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.","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>.","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>.","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>"},"type":"conference","oa_version":"Published Version","status":"public","extern":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","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"}],"year":"2017","publication_identifier":{"issn":["1868-8969"],"isbn":["978-3-95977-049-1"]},"author":[{"last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H"},{"first_name":"Dariusz","full_name":"Leniowski, Dariusz","last_name":"Leniowski"},{"last_name":"Mathieu","full_name":"Mathieu, Claire","first_name":"Claire"}],"doi":"10.4230/LIPICS.ESA.2017.48","_id":"11832","alternative_title":["LIPIcs"],"volume":87,"external_id":{"arxiv":["1707.02577"]},"date_published":"2017-09-01T00:00:00Z","day":"01","publication_status":"published","publication":"25th Annual European Symposium on Algorithms","conference":{"start_date":"2017-09-04","name":"ESA: Annual European Symposium on Algorithms","end_date":"2017-09-06","location":"Vienna, Austria"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"        87","language":[{"iso":"eng"}],"quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://doi.org/10.4230/LIPICS.ESA.2017.48","open_access":"1"}]}