Finding approximate solutions to combinatorial problems with very large data sets using BIRCH (Q962302)
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: Finding approximate solutions to combinatorial problems with very large data sets using BIRCH |
scientific article; zbMATH DE number 5689620
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding approximate solutions to combinatorial problems with very large data sets using BIRCH |
scientific article; zbMATH DE number 5689620 |
Statements
Finding approximate solutions to combinatorial problems with very large data sets using BIRCH (English)
0 references
6 April 2010
0 references
0.747923731803894
0 references
0.7172598242759705
0 references
0.70990389585495
0 references
