APPROXIMATING THE DISCRETE RESOURCE SHARING SCHEDULING PROBLEM (Q2997925)

From MaRDI portal
Revision as of 06:32, 26 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
APPROXIMATING THE DISCRETE RESOURCE SHARING SCHEDULING PROBLEM
scientific article

    Statements

    APPROXIMATING THE DISCRETE RESOURCE SHARING SCHEDULING PROBLEM (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 May 2011
    0 references
    resource allocation
    0 references
    combining algorithms
    0 references
    approximation schemes
    0 references
    oracle-guess approximation
    0 references
    SAT solver
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references