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

DOI10.1007/978-3-319-62389-4_47MaRDI QIDQ2412437zbMATH OpenOpenAlexFDO

Authors Dongmei Zhang, Chunlin Hao, Zhenning Zhang, Chenchen Wu, Dachuan Xu

Publication date 23 October 2017

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

zbMATH Keywords

\(k\)-meansapproximation algorithmlocal searchpenalty

Mathematics Subject Classification ID

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

Recommendations

• Local search approximation algorithms for the k-means problem with penalties
• An improved primal-dual approximation algorithm for the k-means problem with penalties
• An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme
• Approximation algorithm for spherical \(k\)-means problem with penalty
• An improved approximation algorithm for the \(k\)-means problem with penalties

Cited in

(15)

• An improved Bregman k-means++ algorithm via local search
• An approximation algorithm for the k-level facility location problem with outliers
• Improved local search algorithms for Bregman k-means and its variants
• An exact algorithm for stable instances of the k-means problem with penalties in fixed-dimensional Euclidean space
• Local search approximation algorithms for the sum of squares facility location problems
• The seeding algorithm for k-means problem with penalties
• An improved approximation algorithm for the \(k\)-means problem with penalties
• Local search approximation algorithms for the k-means problem with penalties
• Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics
• An improved primal-dual approximation algorithm for the k-means problem with penalties
• The Parallel Seeding Algorithm for k-Means Problem with Penalties
• Effective Heuristic Techniques for Combined Robust Clustering Problem
• Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques
• Local search yields a PTAS for fixed-dimensional k-means problem with penalties
• An approximation algorithm based on seeding algorithm for fuzzy k-means problem with penalties

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2412437)