Upper bound for the approximation ratio of a class of hypercube segmentation algorithms (Q835011)
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: Upper bound for the approximation ratio of a class of hypercube segmentation algorithms |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bound for the approximation ratio of a class of hypercube segmentation algorithms |
scientific article |
Statements
Upper bound for the approximation ratio of a class of hypercube segmentation algorithms (English)
0 references
27 August 2009
0 references
approximation algorithms
0 references
combinatorial problems
0 references
clustering
0 references
data mining
0 references
