Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835)

From MaRDI portal
Revision as of 03:54, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
scientific article

    Statements

    Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (English)
    0 references
    0 references
    0 references
    0 references
    30 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithms
    0 references
    exponential time algorithms
    0 references
    maximum independent set
    0 references
    minimum vertex cover
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references