An approximating polynomial algorithm for a sequence partitioning problem (Q5264726)
From MaRDI portal
scientific article; zbMATH DE number 6466084
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximating polynomial algorithm for a sequence partitioning problem |
scientific article; zbMATH DE number 6466084 |
Statements
An approximating polynomial algorithm for a sequence partitioning problem (English)
0 references
27 July 2015
0 references
Euclidean vector sequence
0 references
clustering
0 references
minimum sum-of-squared distances
0 references
NP-hardness
0 references
polynomial 2-approximation algorithm
0 references
