A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem (Q3186861)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem |
scientific article |
Statements
A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem (English)
0 references
12 August 2016
0 references
partitioning
0 references
sequence
0 references
Euclidean space
0 references
minimum sum-of-squared distances
0 references
NP-hardness
0 references
FPTAS
0 references
0 references
0 references
0 references
0 references
