On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks (Q2827800)

From MaRDI portal
Revision as of 19:26, 12 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 Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks
scientific article

    Statements

    On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks (English)
    0 references
    0 references
    21 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references