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

DOI10.1137/1.9781611975482.183zbMath1432.68516arXiv1807.05443OpenAlexW2952098125MaRDI QIDQ5236376

Mohammad R. Salavatipour, Zachary Friggstad, Kamyar Khodamoradi

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.05443

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

Graph pricing with limited supply ⋮ An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Smooth and strong PCPs ⋮ On perturbation resilience of non-uniform \(k\)-center

This page was built for publication: Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS