← 研踪 PaperTrailarXiv:2604.00954 · v2
Fully Scalable MPC Algorithms for Euclidean Clustering: Constant Approximation in Constant Rounds
首次提交 2026-04-01 22:29
版本更新 2026-11-03 16:14
雷达观测 2026-11-04 23:39
摘要
We study Euclidean $k$-Means and $k$-Median under the Massively Parallel Computation (MPC) model, focusing on the \emph{fully scalable} setting. Previously, fully scalable algorithms for $k$-Means and/or $k$-Median either required $O(\log\log n\cdot\log\log\log n)$ rounds [Cohen-Addad, Kuhn, and Parsaeian; SODA'26] or guaranteed only an $O(\log n)$-approximation [Goranci, Jiang, Kiss, Kong, Qian, and Szilagyi; SODA'26]. In this paper, we close this gap by giving the first fully scalable algorithms for both problems, which work even when $k$ is polynomially larger than the local memory, and \emph{simultaneously} achieve an $O(1)$-approximation and $O(1)$ round complexity. Technically, we devise a new variant of the MP algorithm [Mettu and Plaxton, SICOMP'03] that computes a \emph{fractional solution satisfying the Lagrangian Multiplier Preserving (LMP) property}. Importantly, this LMP guarantee holds even under arbitrary distance distortions, a feature that is crucial for efficient MPC implementations. We then give a novel MPC rounding algorithm that first rounds to a bicriteria solution with $k+O(n^{1-ε})$ centers and then uses an \emph{iterative kernelization} idea to convert it into one with exactly $k$ centers.
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-03 16:14 · 最新观测版本
Fully Scalable MPC Algorithms for Euclidean Clustering: Constant Approximation in Constant Rounds
We study Euclidean $k$-Means and $k$-Median under the Massively Parallel Computation (MPC) model, focusing on the \emph{fully scalable} setting. Previously, fully scalable algorithms for $k$-Means and/or $k$-Median either required $O(\log\log n\cdot\log\log\log n)$ rounds [Cohen-Addad, Kuhn, and Parsaeian; SODA'26] or guaranteed only an $O(\log n)$-approximation [Goranci, Jiang, Kiss, Kong, Qian, and Szilagyi; SODA'26]. In this paper, we close this gap by giving the first fully scalable algorithms for both problems, which work even when $k$ is polynomially larger than the local memory, and \emph{simultaneously} achieve an $O(1)$-approximation and $O(1)$ round complexity. Technically, we devise a new variant of the MP algorithm [Mettu and Plaxton, SICOMP'03] that computes a \emph{fractional solution satisfying the Lagrangian Multiplier Preserving (LMP) property}. Importantly, this LMP guarantee holds even under arbitrary distance distortions, a feature that is crucial for efficient MPC implementations. We then give a novel MPC rounding algorithm that first rounds to a bicriteria solution with $k+O(n^{1-ε})$ centers and then uses an \emph{iterative kernelization} idea to convert it into one with exactly $k$ centers.
查看此版本解读 →查看此版本原文 ↗