Discrete & Computational Geometry

, Volume 37, Issue 1, pp 3–19 | Cite as

Smaller Coresets for k-Median and k-Means Clustering

  • Sariel Har-PeledEmail author
  • Akash KushalEmail author


In this paper we show that there exists a \((k,\varepsilon)\)-coreset for k-median and k-means clustering of n points in \({\cal R}^d,\) which is of size independent of n. In particular, we construct a \((k,\varepsilon)\)-coreset of size \(O(k^2/\varepsilon^d)\) for k-median clustering, and of size \(O(k^3/\varepsilon^{d+1})\) for k-means clustering.


Voronoi Diagram Discrete Comput Geom Cluster Problem Cumulative Error Weighted Point 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer 2006

Authors and Affiliations

  1. 1.Department of Computer Science, University of Illinois, 201 N. Goodwin AvenueUrbana, IL 61801USA

Personalised recommendations