An approximation algorithm for a problem of partitioning a sequence into clusters with restrictions on their cardinalities (Q3133210)
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 algorithm for a problem of partitioning a sequence into clusters with restrictions on their cardinalities |
scientific article; zbMATH DE number 6837843
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for a problem of partitioning a sequence into clusters with restrictions on their cardinalities |
scientific article; zbMATH DE number 6837843 |
Statements
An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities (English)
0 references
13 February 2018
0 references
clustering
0 references
structural constraints
0 references
Euclidean space
0 references
minimum sum-of-squared distances
0 references
NP-hardness
0 references
guaranteed approximation factor
0 references
0.9813406467437744
0 references
0.96269291639328
0 references
0.8947575092315674
0 references
0.8860809803009033
0 references
0.8750882148742676
0 references
