Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability (Q2043627)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability |
scientific article; zbMATH DE number 7377486
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability |
scientific article; zbMATH DE number 7377486 |
Statements
Quadratic Euclidean 1-mean and 1-median 2-clustering problem with constraints on the size of the clusters: complexity and approximability (English)
0 references
3 August 2021
0 references
Euclidean space
0 references
clustering
0 references
2-partition
0 references
quadratic variation
0 references
center
0 references
centroid
0 references
median
0 references
strong NP-hardness
0 references
nonexistence of FPTAS
0 references
approximation-preserving reduction
0 references
0.905630111694336
0 references
0.883208155632019
0 references
