Almost Optimal Fully Dynamic $k$-Center Clustering with Recourse

In this paper, we consider the *metric $k$-center* problem in the fully dynamic setting, where we are given a metric space $(V,d)$ evolving via a sequence of point insertions and deletions and our task is to maintain a subset $S \subseteq V$ of at most $k$ points that minimizes the objective $\max_{x \in V} \min_{y \in S}d(x, y)$. We want to design our algorithm so that we minimize its *approximation ratio*, *recourse* (the number of changes it makes to the solution $S$) and *update time* (the time it takes to handle an update). We give a simple algorithm for dynamic $k$-center that maintains a $O(1)$-approximate solution with $O(1)$ amortized recourse and $\tilde O(k)$ amortized update time, *obtaining near-optimal approximation, recourse and update time simultaneously*. We obtain our result by combining a variant of the dynamic $k$-center algorithm of Bateni et al. [SODA'23] with the dynamic sparsifier of Bhattacharya et al. [NeurIPS'23].

Clustering data is a fundamental task in unsupervised learning. In this task, we need to partition the elements of a dataset into different groups (called clusters) so that elements in the same group are similar to each other, and elements in different groups are not. In recent years, massive and rapidly changing datasets have become increasingly common. In our paper, we design an algorithm for maintaining a clustering of such a dataset, showing how to efficiently maintain a high-quality and stable clustering as the dataset changes over time.