A Randomized Algorithm for a Sequence 2-Clustering Problem

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

Original language	English
Pages (from-to)	2078-2085
Number of pages	8
Journal	Computational Mathematics and Mathematical Physics
Volume	58
Issue number	12
DOIs	https://doi.org/10.1134/S0965542518120138
Publication status	Published - 1 Jan 2018

partitioning, sequence, Euclidean space, minimum sum-of-squared distances, NP-hardness, randomized algorithm, asymptotic accuracy, Asymptotic accuracy, Partitioning, Sequence, Randomized algorithm, Minimum sum-of-squared distances

ID: 18631871