On the parametric complexity of schedules to minimize tardy tasks. (Q1874274)

From MaRDI portal
Revision as of 15:06, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/tcs/FellowsM03, #quickstatements; #temporary_batch_1731505720702)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the parametric complexity of schedules to minimize tardy tasks.
scientific article

    Statements

    title
    On the parametric complexity of schedules to minimize tardy tasks. (English)
    0 references
    author
    Michael R. Fellows
    0 references
    Catherine McCartin
    0 references
    publication date
    25 May 2003
    0 references
    zbMATH Keywords
    parameterized complexity theory
    0 references

    Identifiers

    zbMATH DE Number
    1915465
    0 references
    Wikidata QID
    Q57360052
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1874274&oldid=37906223"
    Powered by MediaWiki