On approximating minimum vertex cover for graphs with perfect matching (Q4472486)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2080241
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On approximating minimum vertex cover for graphs with perfect matching |
scientific article; zbMATH DE number 2080241 |
Statements
4 August 2004
0 references
1.000000238418579
0 references
0.942158579826355
0 references
0.926663100719452
0 references
0.8584005832672119
0 references
0.8196227550506592
0 references
On approximating minimum vertex cover for graphs with perfect matching (English)
0 references