Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems (Q3587384)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
scientific article

    Statements

    Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems (English)
    0 references
    0 references
    0 references
    7 September 2010
    0 references

    Identifiers

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