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
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1134/s096554251911006x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3014008886 / rank | |||
Normal rank | |||
Latest revision as of 10:24, 30 July 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
