Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Fully Scalable MPC Algorithms for Euclidean k-Center
Artur Czumaj, Guichen Gao, Mohsen Ghaffari +1
The -center problem is a fundamental optimization problem with numerous applications in machine learning, data analysis, data mining, and communication networks. The -center…
cs.DS2024
Fully Scalable MPC Algorithms for Clustering in High Dimension
Artur Czumaj, Guichen Gao, Shaofeng H. -C. Jiang +2
We design new parallel algorithms for clustering in high-dimensional Euclidean spaces. These algorithms run in the Massively Parallel Computation (MPC) model, and are fully scalabl…