NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters (Q2304346): 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/s1064562419050028 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2986153947 / rank | |||
Normal rank | |||
Revision as of 10:37, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters |
scientific article |
Statements
NP-completeness of some problems of partitioning a finite set of points in Euclidean space into balanced clusters (English)
0 references
11 March 2020
0 references
partitioning
0 references
set of points in Euclidean space
0 references
clusters
0 references
intracluster quadratic variance
0 references
cluster size
0 references
NP-completeness
0 references
