2 papers
cs.CG2025
Space Complexity of Euclidean Clustering
Xiaoyi Zhu, Yuxiang Tian, Lingxiao Huang +1
The -Clustering problem in Euclidean space has been extensively studied. Given the scale of data involved, compression methods for the Euclidean -Clu…
cs.DS2024
Near-Optimal Dimension Reduction for Facility Location
Lingxiao Huang, Shaofeng H. -C. Jiang, Robert Krauthgamer +1
Oblivious dimension reduction, Ã la the Johnson-Lindenstrauss (JL) Lemma, is a fundamental approach for processing high-dimensional data. We study this approach for Uniform Facilit…