Fully Dynamic k-Clustering in Õ(k) Update Time

Sayan Bhattacharya, Martín Costa, Silvio Lattanzi, Nikos Parotsidis

2/12/2026

No official code found. Best implementation: andreasr27/DCC (1 star, last commit 2024-06-03).

DOI Semantic Scholar

Code Implementations(1)

andreasr27/DCCCommunity100%

code for the paper "Dynamic Correlation Clustering in Sublinear Update Time" accepted at ICML 2024

11Python, Jupyter NotebookMay 28, 20242 years ago

Similar Papers

Improved Guarantees for Fully Dynamic k-Center Clustering with Outliers in General Metric Spaces

SFESS: Score Function Estimators for k-Subset Sampling

88% match1 repo42026

Differentially Private Federated k-Means Clustering with Server-Side Data

88% match1 repo62026

Geometric Median (GM) Matching for Robust k-Subset Selection from Noisy Data

Average Sensitivity of Hierarchical k-Median Clustering

Faster Query Times for Fully Dynamic k-Center Clustering with Outliers

Cite this paper

@article{bhattacharya2026fully,
  title  = {Fully Dynamic k-Clustering in Õ(k) Update Time},
  author = {Sayan Bhattacharya and Martín Costa and Silvio Lattanzi and Nikos Parotsidis},
  year   = {2026},
  doi    = {10.48550/arXiv.2310.17420},
  url    = {https://doi.org/10.48550/arXiv.2310.17420},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

[![Code of Paper](https://codeofpaper.com/badge/2533e8a0c2f52bf957977783b4fac8ac3f27488b.svg)](https://codeofpaper.com/paper/2533e8a0c2f52bf957977783b4fac8ac3f27488b)

Discussion