@article{Bateni_Esfandiari_Fischer_Mirrokni_2021, title={Extreme k-Center Clustering}, volume={35}, url={https://ojs.aaai.org/index.php/AAAI/article/view/16513}, DOI={10.1609/aaai.v35i5.16513}, abstractNote={Metric clustering is a fundamental primitive in machine learning with several applications for mining massive datasets. An important example of metric clustering is the k-center problem. While this problem has been extensively studied in distributed settings, all previous algorithms use Ω(k) space per machine and Ω(n k) total work. In this paper, we develop the first highly scalable approximation algorithm for k-center clustering, with O~(n^ε) space per machine and O~(n^(1+ε)) total work, for arbitrary small constant ε. It produces an O(log log log n)-approximate solution with k(1+o(1)) centers in O(log log n) rounds of computation.}, number={5}, journal={Proceedings of the AAAI Conference on Artificial Intelligence}, author={Bateni, MohammadHossein and Esfandiari, Hossein and Fischer, Manuela and Mirrokni, Vahab}, year={2021}, month={May}, pages={3941-3949} }