An asymptotic fully polynomial time approximation scheme for bin covering. (Q1426473)

From MaRDI portal
Revision as of 23:53, 20 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An asymptotic fully polynomial time approximation scheme for bin covering.
scientific article

    Statements

    An asymptotic fully polynomial time approximation scheme for bin covering. (English)
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    0 references
    Asymptotic approximation scheme
    0 references
    Bin covering
    0 references
    Linear programming
    0 references