Stability Yields a PTAS for k-Median and k-Means Clustering

@article{Awasthi2010StabilityYA,
  title={Stability Yields a PTAS for k-Median and k-Means Clustering},
  author={Pranjal Awasthi and Avrim Blum and Or Sheffet},
  journal={2010 IEEE 51st Annual Symposium on Foundations of Computer Science},
  year={2010},
  pages={309-318}
}
We consider $k$-median clustering in finite metric spaces and $k$-means clustering in Euclidean spaces, in the setting where $k$ is part of the input (not a constant). For the $k$-means problem, Ostrovsky et al. show that if the optimal $(k-1)$-means clustering of the input is more expensive than the optimal $k$-means clustering by a factor of $1/\epsilon^2$, then one can achieve a $(1+f(\epsilon))$-approximation to the $k$-means optimal in time polynomial in $n$ and $k$ by using a variant of… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

110 Citations

01020'11'13'15'17'19
Citations per Year
Semantic Scholar estimates that this publication has 110 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES

Ten g

  • Maria-Florina Balcan, Heiko Röglin, Shang-Hua
  • Agnostic clustering. InALT, pages 384–398,
  • 2009
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…