• DOI:10.1137/1.9781611975482.183
Corpus ID: 49865010

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means

@article{Friggstad2019ExactAA,
  title={Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means},
  author={Zachary Friggstad and Kamyar Khodamoradi and M. Salavatipour},
  journal={ArXiv},
  year={2019},
  volume={abs/1807.05443}
}

Zachary Friggstad, Kamyar Khodamoradi, M. Salavatipour

Published 2019

Mathematics, Computer Science

ArXiv

We investigate the complexity of solving stable or perturbation-resilient instances of k-Means and k-Median clustering in fixed dimension Euclidean metrics (or more generally doubling metrics). The notion of stable or perturbation resilient instances was introduced by Bilu and Linial [2010] and Awasthi et al. [2012]. In our context we say a k-Means instance is \alpha-stable if there is a unique OPT solution which remains unchanged if distances are (non-uniformly) stretched by a factor of at… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed