Аннотация
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 the intracluster quadratic variance normalized by the cluster size in the first problem, the intracluster quadratic variance in the second problem, and the size-weighted intracluster variance in the third problem. The NP-completeness of all these problems is proved.
Язык оригинала | английский |
---|---|
Страницы (с-по) | 163-170 |
Число страниц | 8 |
Журнал | Computational Mathematics and Mathematical Physics |
Том | 60 |
Номер выпуска | 1 |
DOI | |
Состояние | Опубликовано - янв 2020 |