Approximation of dense-\(\frac n2\)-subgraph and table compression problems (Q882965)
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: Approximation of dense- n2-subgraph and table compression problems |
scientific article; zbMATH DE number 5157275
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation of dense-\(\frac n2\)-subgraph and table compression problems |
scientific article; zbMATH DE number 5157275 |
Statements
Approximation of dense-\(\frac n2\)-subgraph and table compression problems (English)
0 references
29 May 2007
0 references
approximation ratio
0 references
approximation algorithms
0 references
relaxation
0 references
rounding
0 references
greedy algorithm
0 references
0.8542451858520508
0 references
0.8126447200775146
0 references
0.8090680241584778
0 references
0.7963979840278625
0 references
