Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center (Q1746358)
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: Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center |
scientific article; zbMATH DE number 6864307
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center |
scientific article; zbMATH DE number 6864307 |
Statements
Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center (English)
0 references
25 April 2018
0 references
Euclidean space
0 references
weighted 2-clustering
0 references
NP-hardness
0 references
polynomial-time 2-approximation algorithm
0 references
0 references
0 references
0 references
0 references
0.9076560139656068
0 references
0.8984925746917725
0 references
0.8940003514289856
0 references
0.8853887915611267
0 references
