# The Hardness of Approximation of Euclidean k-Means

@inproceedings{Awasthi2015TheHO,
title={The Hardness of Approximation of Euclidean k-Means},
author={Pranjal Awasthi and M. Charikar and Ravishankar Krishnaswamy and A. Sinop},
booktitle={SoCG},
year={2015}
}
The Euclidean $k$-means problem is a classical problem that has been extensively studied in the theoretical computer science, machine learning and the computational geometry communities. In this problem, we are given a set of $n$ points in Euclidean space $R^d$, and the goal is to choose $k$ centers in $R^d$ so that the sum of squared distances of each point to its nearest center is minimized. The best approximation algorithms for this problem include a polynomial time constant factor… Expand
120 Citations

#### References

SHOWING 1-10 OF 45 REFERENCES
A Constant-Factor Approximation Algorithm for the k-Median Problem
• Computer Science, Mathematics
• J. Comput. Syst. Sci.
• 2002
Approximating Maximum Subgraphs without Short Cycles
• Mathematics, Computer Science
• SIAM J. Discret. Math.
• 2010
The Planar k-Means Problem is NP-Hard
• Mathematics, Computer Science
• WALCOM
• 2009
Embeddings and non-approximability of geometric problems
• Mathematics, Computer Science
• SODA '03
• 2003
Approximate clustering without the approximation
• Computer Science, Mathematics
• SODA
• 2009
Approximating Maximum Subgraphs without Short Cycles
• Mathematics, Computer Science
• APPROX-RANDOM
• 2008