A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies (Q5361827)

From MaRDI portal
Revision as of 05:37, 23 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6784068
Language Label Description Also known as
English
A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies
scientific article; zbMATH DE number 6784068

    Statements

    A (1+epsilon)-approximation for makespan scheduling with precedence constraints using LP hierarchies (English)
    0 references
    0 references
    0 references
    29 September 2017
    0 references
    scheduling
    0 references
    approximation algorithms
    0 references
    hierarchies
    0 references
    linear programming relaxations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references