An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem (Q403490)

From MaRDI portal
Revision as of 23:51, 8 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
An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem
scientific article

    Statements

    An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem (English)
    0 references
    0 references
    0 references
    0 references
    29 August 2014
    0 references
    approximation algorithm
    0 references
    iterative rounding
    0 references
    \(k\)-partial vertex cover
    0 references
    combinatorial optimization
    0 references

    Identifiers

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