A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption (Q2896382)

From MaRDI portal
Revision as of 13:48, 22 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
A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption
scientific article

    Statements

    A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption (English)
    0 references
    0 references
    0 references
    16 July 2012
    0 references

    Identifiers