On the Complexity of Some Problems of Searching for a Family of Disjoint Clusters
Alexander V. Kel’manov, A. V. Pyatkin, ВЛАДИМИР ИЛЬИЧ ХАНДЕЕВ · Doklady Mathematics · 2019
Abstract Two consimilar problems of searching for a family of disjoint subsets (clusters) in a finite set of points of Euclidean space are considered. In these problems, the task is to maximize the minimum cluster size so that the value of each intercluster quadratic variation does not exceed a given fraction (constant) of the total quadratic variation of the points of the input set with respect to its centroid. Both problems are proved to be NP-hard even on a line.