A linear time deterministic algorithm to find a small subset that approximates the centroid (Q2380033): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ipl.2007.07.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2134045991 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On graph problems in a semi-streaming model / rank | |||
Normal rank | |||
Latest revision as of 15:25, 2 July 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
