Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms (Q995573)
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 vertex cover in sublinear time and a connection to distributed algorithms |
scientific article; zbMATH DE number 5186614
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms |
scientific article; zbMATH DE number 5186614 |
Statements
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms (English)
0 references
3 September 2007
0 references
sublinear approximation algorithms
0 references
distributed algorithms
0 references
minimum vertex cover
0 references
0 references
