A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size (Q5743463)
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: A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size |
scientific article; zbMATH DE number 7053340
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size |
scientific article; zbMATH DE number 7053340 |
Statements
10 May 2019
0 references
0 references
0 references
0.8066824078559875
0 references
0.8042705059051514
0 references
0.8027559518814087
0 references
0.8026852011680603
0 references
0.7950406670570374
0 references
