Improved and simplified inapproximability for k-means

Citations of this article
Mendeley users who have this article in their library.


The k-means problem consists of finding k centers in Rd that minimize the sum of the squared distances of all points in an input set P from Rd to their closest respective center. Awasthi et al. recently showed that there exists a constant ε′>0 such that it is NP-hard to approximate the k-means objective within a factor of 1+ε′. We establish that 1+ε′ is at least 1.0013.




Lee, E., Schmidt, M., & Wright, J. (2017). Improved and simplified inapproximability for k-means. Information Processing Letters, 120, 40–43.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free