Quadratic Euclidean 1-Mean and 1-Median 2-Clustering Problem with Constraints on the Size of the Clusters: Complexity and Approximability

Autor: Alexander Kel'manov, V. I. Khandeev, Artem V. Pyatkin
Rok vydání: 2021
Předmět:
Zdroj: Proceedings of the Steklov Institute of Mathematics. 313:S117-S124
ISSN: 1531-8605
0081-5438
DOI: 10.1134/s0081543821030123
Popis: We consider the problem of partitioning a set of $$N$$ points in $$d$$ -dimensional Euclidean space into two clusters minimizing the sum of the squared distances between each element and the center of the cluster to which it belongs. The center of the first cluster is its centroid (the geometric center). The center of the second cluster should be chosen among the points of the input set. We analyze the variant of the problem with given sizes (cardinalities) of the clusters; the sum of the sizes equals the cardinality of the input set. We prove that the problem is strongly NP-hard and there is no fully polynomial-time approximation scheme for it.
Databáze: OpenAIRE
Externí odkaz: