A local search approximation algorithm for the \(k\)-means problem with penalties

DOI10.1007/978-3-319-62389-4_47zbMath1434.68686OpenAlexW2732234489MaRDI QIDQ2412437

Dongmei Zhang, Chunlin Hao, Zhenning Zhang, Da-Chuan Xu, Chen-Chen Wu

Publication date: 23 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_47

zbMATH Keywords

approximation algorithmlocal search\(k\)-meanspenalty

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (4)

Effective Heuristic Techniques for Combined Robust Clustering Problem ⋮ Local search approximation algorithms for the sum of squares facility location problems ⋮ The seeding algorithm for \(k\)-means problem with penalties ⋮ An approximation algorithm for the \(k\)-level facility location problem with outliers

This page was built for publication: A local search approximation algorithm for the \(k\)-means problem with penalties