A linear time deterministic algorithm to find a small subset that approximates the centroid (Q2380033)
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: A linear time deterministic algorithm to find a small subset that approximates the centroid |
scientific article; zbMATH DE number 5686465
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time deterministic algorithm to find a small subset that approximates the centroid |
scientific article; zbMATH DE number 5686465 |
Statements
A linear time deterministic algorithm to find a small subset that approximates the centroid (English)
0 references
24 March 2010
0 references
computational geometry
0 references
clustering
0 references
derandomization
0 references
0.8780034
0 references
0.86828554
0 references
0.8667373
0 references
0.85789967
0 references
0.85730577
0 references
0.8508771
0 references
0.84937185
0 references
0 references
