A linear time deterministic algorithm to find a small subset that approximates the centroid (Q2380033): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:54, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time deterministic algorithm to find a small subset that approximates the centroid |
scientific article |
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
