An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities (Q1744981)
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 constraints on their cardinalities |
scientific article; zbMATH DE number 6862368
| 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 constraints on their cardinalities |
scientific article; zbMATH DE number 6862368 |
Statements
An approximation algorithm for a problem of partitioning a sequence into clusters with constraints on their cardinalities (English)
0 references
20 April 2018
0 references
partitioning
0 references
sequence
0 references
Euclidean space
0 references
minimum sum of squared distances
0 references
NP-hardness
0 references
approximation algorithm
0 references
0 references
0 references
0.9813406467437744
0 references
0.9728102684020996
0 references
0.8956822752952576
0 references
0.8818646669387817
0 references
0.8743656873703003
0 references
