An approximation polynomial-time algorithm for a sequence bi-clustering problem (Q498594)
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: An approximation polynomial-time algorithm for a sequence bi-clustering problem |
scientific article; zbMATH DE number 6486292
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation polynomial-time algorithm for a sequence bi-clustering problem |
scientific article; zbMATH DE number 6486292 |
Statements
An approximation polynomial-time algorithm for a sequence bi-clustering problem (English)
0 references
29 September 2015
0 references
sequence of Euclidean vectors
0 references
clustering
0 references
minimum of the sum of squared distances
0 references
NP-hardness
0 references
approximation polynomial-time algorithm
0 references
0 references
0 references
