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
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q126788242, #quickstatements; #temporary_batch_1723538522512 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126788242 / rank | |||
Normal rank | |||
Latest revision as of 10:49, 13 August 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
