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
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 07:18, 5 March 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