Papers › Fully Dynamic k-Clustering in Õ(k) Update Time
Fully Dynamic k-Clustering in Õ(k) Update Time
We present a O(1)-approximate fully dynamic algorithm for the k-median and k-means problems on metric spaces with amortized update time Õ(k) and worst-case query time Õ(k²). We complement our theoretical analysis with the first in-depth experimental study for the dynamic k-median problem on general metrics, focusing on comparing our dynamic algorithm to the current state-of-the-art by Henzinger and Kale [ESA'20]. Finally, we also provide a lower bound for dynamic k-median which shows that any O(1)-approximate algorithm with Õ(poly(k)) query time must have Ω̃(k) amortized update time, even in the incremental setting.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections