Improved approximations for Euclidean <i>k</i> -means and <i>k</i> -median, via nested quasi-independent sets-Reference-Cited by-同舟云学术

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

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Cohen-Addad Vincent¹,Esfandiari Hossein²,Mirrokni Vahab²,Narayanan Shyam³

Affiliation:

1. Google Research, Switzerland

2. Google Research, USA

3. Massachusetts Institute of Technology, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519935.3520011

Reference41 articles.

1. Better guarantees for k-means and Euclidean k-median by primal-dual algorithms;Ahmadian Sara;SIAM J. Comput.,2019

2. David Arthur and Sergei Vassilvitskii . 2007 . k-means++: the advantages of careful seeding . In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 , New Orleans, Louisiana, USA , January 7-9, 2007, Nikhil Bansal, Kirk Pruhs, and Cliford Stein (Eds.). SIAM, 1027-1035. http://dl.acm.org/citation.cfm?id= 1283383. 1283494 David Arthur and Sergei Vassilvitskii. 2007. k-means++: the advantages of careful seeding. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, Nikhil Bansal, Kirk Pruhs, and Cliford Stein (Eds.). SIAM, 1027-1035. http://dl.acm.org/citation.cfm?id= 1283383. 1283494

3. Worst-Case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-Means Method

4. Local Search Heuristics for k-Median and Facility Location Problems

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deterministic metric 1-median selection with very few queries;Theoretical Computer Science;2024-10

2. Resilient k-Clustering;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

3. On the Budgeted Priority p-Median Problem in High-Dimensional Euclidean Spaces;Journal of the Operations Research Society of China;2024-03-22

4. An Evaluation of Decentralized Group Formation Techniques for Flying Light Specks;ACM Multimedia Asia 2023;2023-12-06

5. The Price of Explainability for Clustering;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06