Аннотация
We consider three related problems of partitioning an N-element set of points in d-dimensional Euclidean space into two clusters balancing the value of (1) the intracluster quadratic variance normalized by the cluster size in the first problem; (2) the intracluster quadratic variance in the second problem; and (3) the size-weighted intracluster quadratic variance in the third problem. The NP-completeness of all these problems is proved.
Язык оригинала | английский |
---|---|
Страницы (с-по) | 416-419 |
Число страниц | 4 |
Журнал | Doklady Mathematics |
Том | 100 |
Номер выпуска | 2 |
DOI | |
Состояние | Опубликовано - 1 сент. 2019 |