No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970)

From MaRDI portal
Revision as of 07:58, 2 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    23 February 2015
    0 references
    distributed graph algorithms
    0 references
    local approximation
    0 references
    lower bounds
    0 references
    vertex cover
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references