An efficient polynomial time approximation scheme for load balancing on uniformly related machines (Q463715)

From MaRDI portal
Revision as of 05:02, 9 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
An efficient polynomial time approximation scheme for load balancing on uniformly related machines
scientific article

    Statements

    title
    An efficient polynomial time approximation scheme for load balancing on uniformly related machines (English)
    0 references
    author
    Leah Epstein
    0 references
    Asaf Levin
    0 references
    publication date
    17 October 2014
    0 references
    zbMATH Keywords
    EPTAS
    0 references
    load balancing
    0 references
    scheduling
    0 references
    approximation algorithms
    0 references
    cites work
    Q5501827
    0 references
    Q4252723
    0 references
    Q4400843
    0 references
    Q3579419
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68W25
    0 references
    68Q25
    0 references
    90C27
    0 references
    90C59
    0 references
    zbMATH DE Number
    6357711
    0 references
    OpenAlex ID
    W2083173650
    0 references
    arXiv ID
    1202.4072
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q463715&oldid=35417258"
    Powered by MediaWiki