Online interval scheduling on two related machines: the power of lookahead (Q2424805)

From MaRDI portal
Revision as of 11:07, 28 October 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q128627932, #quickstatements; #temporary_batch_1730109530352)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Online interval scheduling on two related machines: the power of lookahead
scientific article

    Statements

    title
    Online interval scheduling on two related machines: the power of lookahead (English)
    0 references
    author
    Nicolas Pinson
    0 references
    Frits C. R. Spieksma
    0 references
    publication date
    25 June 2019
    0 references
    zbMATH Keywords
    online algorithms
    0 references
    interval scheduling
    0 references
    lookahead
    0 references
    competitive ratio
    0 references
    cites work
    Q3128889
    0 references

    Identifiers

    zbMATH DE Number
    7073180
    0 references
    OpenAlex ID
    W2909709363
    0 references
    Wikidata QID
    Q128627932
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2424805&oldid=37865739"
    Powered by MediaWiki