\(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (Q1919171)

From MaRDI portal
Revision as of 13:03, 6 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59567993, #quickstatements; #temporary_batch_1707216511891)
scientific article
Language Label Description Also known as
English
\(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
scientific article

    Statements

    \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (English)
    0 references
    0 references
    0 references
    1 August 1996
    0 references
    multiprocessor scheduling
    0 references
    partial orders
    0 references
    precedence constrained \(K\)-processor scheduling
    0 references
    parameterized complexity
    0 references

    Identifiers

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