New constant-round, fully scalable MPC algorithms improve Euclidean k-center approximation to (2+ε) in low dimension and O(log n/log log n) in high dimension.
Title resolution pending
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
-
Fully Scalable MPC Algorithms for Euclidean k-Center
New constant-round, fully scalable MPC algorithms improve Euclidean k-center approximation to (2+ε) in low dimension and O(log n/log log n) in high dimension.