Towards Tight Lower Bounds for Scheduling Problems (Q3452775)

From MaRDI portal
Revision as of 03:13, 11 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
Towards Tight Lower Bounds for Scheduling Problems
scientific article

    Statements

    title
    Towards Tight Lower Bounds for Scheduling Problems (English)
    0 references
    author
    Abbas Bazzi
    0 references
    Ashkan Norouzi-Fard
    0 references
    publication date
    19 November 2015
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    68R10
    0 references
    90B35
    0 references
    zbMATH DE Number
    6511763
    0 references
    zbMATH Keywords
    hardness of approximation
    0 references
    scheduling problems
    0 references
    unique games conjecture
    0 references
    OpenAlex ID
    W1495318531
    0 references
    arXiv ID
    1507.01906
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3452775&oldid=36214347"
    Powered by MediaWiki