Improved approximations for Euclidean k-means and k-median, via nested quasi-independent sets

被引:0
|
作者
Cohen-Addad, Vincent [1 ]
Esfandiari, Hossein [2 ]
Mirrokni, Vahab [2 ]
Narayanan, Shyam [3 ]
机构
[1] Google Research, Zurich, Switzerland
[2] Google Research, New York City,NY, United States
[3] Massachusetts Institute of Technology, Cambridge,MA, United States
来源
Proceedings of the Annual ACM Symposium on Theory of Computing | 2022年
关键词
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I
暂无
中图分类号
学科分类号
摘要
K-means clustering
引用
收藏
页码:1621 / 1628
相关论文
empty
未找到相关数据