Approximating the Minimum Chain Completion problem (Q989547)
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: Approximating the Minimum Chain Completion problem |
scientific article; zbMATH DE number 5773838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the Minimum Chain Completion problem |
scientific article; zbMATH DE number 5773838 |
Statements
Approximating the Minimum Chain Completion problem (English)
0 references
20 August 2010
0 references
approximation algorithms
0 references
chain graphs
0 references
vertex cover
0 references
min cut
0 references
Max flow
0 references
0.8686383366584778
0 references
0.825753390789032
0 references
0.77679044008255
0 references
0.7718676924705505
0 references
0.7673801779747009
0 references
