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
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:33, 2 February 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
