Approximation algorithm for the problem of partitioning a sequence into clusters (Q1683189)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6816222
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithm for the problem of partitioning a sequence into clusters |
scientific article; zbMATH DE number 6816222 |
Statements
Approximation algorithm for the problem of partitioning a sequence into clusters (English)
0 references
6 December 2017
0 references
partition
0 references
sequence
0 references
Euclidean space
0 references
minimum of the sum of squared distances
0 references
NP-hardness
0 references
approximation algorithm
0 references
0.9728102684020996
0 references
0.96269291639328
0 references
0.9241113662719728
0 references
0.9002151489257812
0 references
0.9000990986824036
0 references
