Divide-and-conquer approximation algorithm for vertex cover (Q3583300)
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: Divide-and-conquer approximation algorithm for vertex cover |
scientific article; zbMATH DE number 5775352
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Divide-and-conquer approximation algorithm for vertex cover |
scientific article; zbMATH DE number 5775352 |
Statements
Divide-and-Conquer Approximation Algorithm for Vertex Cover (English)
0 references
27 August 2010
0 references
vertex cover
0 references
approximation algorithm
0 references
heuristic
0 references
experiments
0 references
0.943416714668274
0 references
0.8935670852661133
0 references
0.8805423974990845
0 references
0.8779990673065186
0 references
0.8719993829727173
0 references
