---
res:
bibo_abstract:
- 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. We 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.@eng
bibo_authorlist:
- foaf_Person:
foaf_givenName: Monika H
foaf_name: Henzinger, Monika H
foaf_surname: Henzinger
foaf_workInfoHomepage: http://www.librecat.org/personId=540c9bbd-f2de-11ec-812d-d04a5be85630
orcid: 0000-0002-5008-6530
- foaf_Person:
foaf_givenName: Dariusz
foaf_name: Leniowski, Dariusz
foaf_surname: Leniowski
- foaf_Person:
foaf_givenName: Claire
foaf_name: Mathieu, Claire
foaf_surname: Mathieu
bibo_doi: 10.1007/s00453-020-00721-7
bibo_issue: '11'
bibo_volume: 82
dct_date: 2020^xs_gYear
dct_isPartOf:
- http://id.crossref.org/issn/0178-4617
- http://id.crossref.org/issn/1432-0541
dct_language: eng
dct_publisher: Springer Nature@
dct_title: Dynamic clustering to minimize the sum of radii@
...