A new MPC algorithm computes a constant-factor k-means approximation with exactly k centers in O(log log n log log log n) rounds and nearly linear global memory.
Better guarantees for \ k\ -means and euclidean \ k\ -median by primal-dual algorithms
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
A new MPC algorithm computes a constant-factor k-means approximation with exactly k centers in O(log log n log log log n) rounds and nearly linear global memory.