No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:26, 2 February 2024
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
