On the optimality of exact and approximation algorithms for scheduling problems (Q1635503)

From MaRDI portal
Revision as of 20:38, 15 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
On the optimality of exact and approximation algorithms for scheduling problems
scientific article

    Statements

    On the optimality of exact and approximation algorithms for scheduling problems (English)
    0 references
    0 references
    0 references
    0 references
    6 June 2018
    0 references
    approximation schemes
    0 references
    scheduling
    0 references
    lower bounds
    0 references
    exponential time hypothesis
    0 references

    Identifiers

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