Randomized Algorithms for Some Hard-to-Solve Problems of Clustering a Finite Set of Points in Euclidean Space

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

Original language	English
Pages (from-to)	842-850
Number of pages	9
Journal	Computational Mathematics and Mathematical Physics
Volume	59
Issue number	5
DOIs	https://doi.org/10.1134/S0965542519050099
Publication status	Published - 1 May 2019

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

ID: 20643006