A tight bound for 3-partitioning (Q1309812)

From MaRDI portal
Revision as of 11:44, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A tight bound for 3-partitioning
scientific article

    Statements

    A tight bound for 3-partitioning (English)
    0 references
    0 references
    0 references
    4 January 1994
    0 references
    3-partition
    0 references
    worst-case analysis
    0 references
    LPT-algorithm
    0 references
    multiprocessor scheduling
    0 references

    Identifiers