An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities

DOI10.1007/978-3-319-44914-2_14zbMath1380.68400OpenAlexW2557272919MaRDI QIDQ3133210

L. V. Mikhailova, Alexander Kel'Manov, Vladimir Khandeev, Sergey Khamidullin

Publication date: 13 February 2018

Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44914-2_14

zbMATH Keywords

clusteringEuclidean spaceNP-hardnessstructural constraintsminimum sum-of-squared distancesguaranteed approximation factor

Mathematics Subject Classification ID

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

This page was built for publication: An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities