An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212)

From MaRDI portal
Revision as of 14:33, 21 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
An optimal rounding gives a better approximation for scheduling unrelated machines
scientific article

    Statements

    An optimal rounding gives a better approximation for scheduling unrelated machines (English)
    0 references
    0 references
    0 references
    25 August 2005
    0 references
    Scheduling
    0 references
    Unrelated machines
    0 references
    Approximation algorithm
    0 references
    Rounding
    0 references

    Identifiers