Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620)
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: Sublinear‐time approximation algorithms for clustering via random sampling |
scientific article; zbMATH DE number 5122858
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sublinear‐time approximation algorithms for clustering via random sampling |
scientific article; zbMATH DE number 5122858 |
Statements
Sublinear‐time approximation algorithms for clustering via random sampling (English)
0 references
7 February 2007
0 references
clustering
0 references
\(k\)-median
0 references
\(k\)-means
0 references
min-sum clustering
0 references
random sampling
0 references
0 references
0 references
0 references
0.90926576
0 references
0.90926576
0 references
0.90843225
0 references
0.9057134
0 references
0.9005203
0 references
0.8999104
0 references
