New algorithms build robust k-medians coresets of size O(m)+O~(kd/epsilon^2) in VC or doubling metrics and O(m/epsilon)+O~(min{k^{4/3}/epsilon^2,k/epsilon^3}) in Euclidean space.
[BJKW21b] Vladimir Braverman, Shaofeng H.-C
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Towards Tight Robust Coresets for $k$-Medians Clustering
New algorithms build robust k-medians coresets of size O(m)+O~(kd/epsilon^2) in VC or doubling metrics and O(m/epsilon)+O~(min{k^{4/3}/epsilon^2,k/epsilon^3}) in Euclidean space.