Quadratic Euclidean 1-Mean and 1-Median 2-Clustering Problem with constraints on the size of the clusters

Quadratic Euclidean 1-Mean and 1-Median 2-Clustering Problem with constraints on the size of the clusters: Complexity and approximability

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

Translated title of the contribution	Квадратичная евклидова задача 2-кластеризации 1-Mean и 1-Median с ограничением на размеры кластеров: сложность и аппроксимируемость
Original language	English
Pages (from-to)	69-78
Number of pages	10
Journal	Trudy Instituta Matematiki i Mekhaniki UrO RAN
Volume	25
Issue number	4
DOIs	https://doi.org/10.21538/0134-4889-2019-25-4-69-78
Publication status	Published - 1 Jan 2019

Euclidean space, clustering, 2-partition, quadratic variation, center, centroid, median, strong NP-hardness, nonexistence of FPTAS, approximation-preserving reduction

ID: 23287203