No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970)
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: No sublogarithmic-time approximation scheme for bipartite vertex cover |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | No sublogarithmic-time approximation scheme for bipartite vertex cover |
scientific article |
Statements
No sublogarithmic-time approximation scheme for bipartite vertex cover (English)
0 references
23 February 2015
0 references
distributed graph algorithms
0 references
local approximation
0 references
lower bounds
0 references
vertex cover
0 references
