[1] Ankit Aggarwal, Amit Deshpande, and Ravi Kannan. Adaptive sampling for  $k$ -means clustering. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 15-28. 2009.
[2] Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, and Justin Ward. Better guarantees for  $k$ -means and euclidean  $k$ -median by primal-dual algorithms. SIAM Journal on Computing, 49(4):17-97, 2019.
[3] David Arthur and Sergei Vassilvitskii.  $k$ -means++: The advantages of careful seeding. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1027-1035, 2007.
[4] Davin Choo, Christoph Grunau, Julian Portmann, and Václav Rozhon.  $k$ -means++: Few more steps yield constant approximation. In Proceedings of the 37th International Conference on Machine Learning, volume 119, pages 1909-1917. PMLR, 2020.
[5] Vincent Cohen-Addad, Hossein Esfandiari, Vahab S. Mirrokni, and Shyam Narayanan. Improved approximations for euclidean  $k$ -means and  $k$ -median, via nested quasi-independent sets. In Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, pages 1621–1628, 2022.
[6] Vincent Cohen-Addad, Philip N Klein, and Claire Mathieu. Local search yields approximation schemes for  $k$ -means and  $k$ -median in euclidean and minor-free metrics. SIAM Journal on Computing, 48(2):644-667, 2019.
[7] Zachary Friggstad, Mohsen Rezapour, and Mohammad R Salavatipour. Local search yields a ptas for  $k$ -means in doubling metrics. SIAM Journal on Computing, 48(2):452-480, 2019.
[8] Fabrizio Grandoni, Rafail Ostrovsky, Yuval Rabani, Leonard J Schulman, and Rakesh Venkat. A refined approximation for euclidean  $k$ -means. Information Processing Letters, 176:106251, 2022.
[9] Junyu Huang, Qilong Feng, Ziyun Huang, Jinhui Xu, and Jianxin Wang. FLS: A new local search algorithm for K-means with smaller search space. In Proceedings of the 31st International Joint Conference on Artificial Intelligence, pages 3092-3098, 2022.
[10] Tapas Kanungo, David M Mount, Nathan S Netanyahu, Christine D Piatko, Ruth Silverman, and Angela Y Wu. A local search approximation algorithm for  $k$ -means clustering. In Proceedings of the 18th Annual Symposium on Computational Geometry, pages 10-18, 2002.
[11] Silvio Lattanzi and Christian Sohler. A better  $k$ -means++ algorithm via local search. In Proceedings of the 36th International Conference on Machine Learning, volume 97, pages 3662-3671. PMLR, 2019.
[12] Stuart Lloyd. Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2):129-137, 1982.
[13] Konstantin Makarychev, Aravind Reddy, and Liren Shan. Improved guarantees for  $k$ -means++ and  $k$ -means++ parallel. In Proceedings of the 34th Conference on Neural Information Processing Systems, pages 16142-16152, 2020.
[14] Yusuke Matsui, Keisuke Ogaki, Toshihiko Yamasaki, and Kiyoharu Aizawa. Pqk-means: Billion-scale clustering for product-quantized codes. In Proceedings of the 25th ACM International Conference on Multimedia, pages 1725–1733, 2017.
[15] Jiayang Ren, Kaixun Hua, and Yankai Cao. Global optimal K-medoids clustering of one million samples. In Proceedings of the 36th Conference on Neural Information Processing Systems, pages 982-994, 2022.
[16] Dennis Wei. A constant-factor bi-criteria approximation guarantee for  $k$ -means++. In Proceedings of the 30th Conference on Neural Information Processing Systems, pages 604-612, 2016.