Improved and Simplified Inapproximability for k-means

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.