Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters (Q2206419): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:44, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters |
scientific article |
Statements
Complexity of some problems of quadratic partitioning of a finite set of points in Euclidean space into balanced clusters (English)
0 references
22 October 2020
0 references
Euclidean space
0 references
balanced partition
0 references
quadratic variance
0 references
variance normalized by cluster size
0 references
size-weighted variance
0 references
NP-completeness
0 references
