Polynomial-Time Solvability of the One-Dimensional Case of an NP-Hard Clustering Problem

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

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

clustering, Euclidean space, minimum sum-of-squares, one-dimensional case, partitioning, polynomial-time solvability, strongly NP-hard problem, COMPLEXITY

ID: 21938810