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
    11 Citations
    Clustering Perturbation Resilient Instances
    On Euclidean k-Means Clustering with α-Center Proximity
    • 2
    • PDF
    On Euclidean k-Means Clustering with alpha-Center Proximity
    • 3
    • PDF
    k-center Clustering under Perturbation Resilience
    • 1
    • PDF
    Clustering under Perturbation Stability in Near-Linear Time
    • Highly Influenced
    • PDF
    Bilu-Linial stability, certified algorithms and the Independent Set problem
    • 5
    • PDF
    On Perturbation Resilience of Non-Uniform k-Center
    • 1
    • PDF
    Smooth and Strong PCPs
    • Orr Paradise
    • Computer Science, Mathematics
    • Electron. Colloquium Comput. Complex.
    • 2019
    • 7
    • PDF

    References

    SHOWING 1-10 OF 29 REFERENCES
    Clustering Stable Instances of Euclidean k-means
    • 19
    • PDF
    Center-based clustering under perturbation stability
    • 107
    • Highly Influential
    • PDF
    Clustering under Perturbation Resilience
    • 80
    • PDF
    Algorithms for stable and perturbation-resilient problems
    • 33
    • Highly Influential
    • PDF
    Data Stability in Clustering: A Closer Look
    • L. Reyzin
    • Mathematics, Computer Science
    • ALT
    • 2012
    • 11
    • PDF
    A local search approximation algorithm for k-means clustering
    • 548
    • PDF
    On the Local Structure of Stable Clustering Instances
    • 26
    • Highly Influential
    • PDF
    Local Search Yields a PTAS for k-Means in Doubling Metrics
    • 71
    • PDF
    Bilu-Linial Stable Instances of Max Cut and Minimum Multiway Cut
    • 46
    • PDF
    The Hardness of Approximation of Euclidean k-Means
    • 113
    • PDF