Approximation algorithm for the problem of partitioning a sequence into clusters

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

Original language	English
Pages (from-to)	1376-1383
Number of pages	8
Journal	Computational Mathematics and Mathematical Physics
Volume	57
Issue number	8
DOIs	https://doi.org/10.1134/S0965542517080085
Publication status	Published - 1 Aug 2017

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

ID: 9916600