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

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	88-96
Number of pages	9
Journal	Proceedings of the Steklov Institute of Mathematics
Volume	299
DOIs	https://doi.org/10.1134/S0081543817090115
Publication status	Published - 1 Dec 2017

approximation algorithm, Euclidean space, minimum sum of squared distances, NP-hardness, partitioning, sequence

ID: 9961347