Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem (Q2630015): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PRMLT / rank | |||
Normal rank | |||
Revision as of 15:17, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem |
scientific article |
Statements
Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem (English)
0 references
8 July 2016
0 references
cluster analysis
0 references
partition
0 references
Euclidean space
0 references
minimum of the sum of squares of distances
0 references
NP-hardness
0 references
fixed space dimension
0 references
FPTAS
0 references
