Improved Approximations for Euclidean k-Means and k-Median, via Nested Quasi-Independent Sets
Main Authors: | Cohen-Addad, Vincent, Esfandiari, Hossein, Mirrokni, Vahab, Narayanan, Shyam |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
2022
|
Online Access: | https://hdl.handle.net/1721.1/146412 |
Similar Items
-
Online k-means clustering
by: Cohen-Addad, V, et al.
Published: (2021) -
Approximation algorithms for distributed and selfish agents
by: Mirrokni, Vahab S
Published: (2006) -
A performance comparison of euclidean, manhattan and minkowski distances in k-means clustering
by: Haviluddin Haviluddin, et al.
Published: (2021) -
Smooth Anonymity for Sparse Graphs
by: Epasto, Alessandro, et al.
Published: (2024) -
Approximate k-means clustering through random projections
by: Persu, Elena-Mădălina
Published: (2015)