Jianing Lou

collaborators

4 papers

cs.DS2026

Fully Dynamic Euclidean k-Means

Sayan Bhattacharya, MartÃn Costa, Ermiya Farokhnejad +3

We consider the Euclidean $k$ -means clustering problem in a dynamic setting, where we have to explicitly maintain a solution (a set of $k$ centers) $S \subseteq R^{d}$ subje…

cs.DS2026

Round-efficient Fully-scalable MPC algorithms for k-Means

Shaofeng H. -C. Jiang, Yaonan Jin, Jianing Lou +1

We study Euclidean $k$ -Means under the Massively Parallel Computation (MPC) model, focusing on the \emph{fully-scalable} setting. Our main result is a fully-scalable $O((\log n/\lo…

cs.DS2025

Local Search for Clustering in Almost-linear Time

Shaofeng H. -C. Jiang, Yaonan Jin, Jianing Lou +1

We propose the first \emph{local search} algorithm for Euclidean clustering that attains an $O (1)$ -approximation in almost-linear time. Specifically, for Euclidean $k$ -Means, our a…

cs.DS2025

Coresets for Robust Clustering via Black-box Reductions to Vanilla Case

Shaofeng H. -C. Jiang, Jianing Lou

We devise $I^µ$ -coresets for robust $(k, z)$ -Clustering with $m$ outliers through black-box reductions to vanilla case. Given an $I^µ$ -coreset construction for vanilla clustering with…