Parallel approximation algorithms for bin packing (Q1123807)

From MaRDI portal
Revision as of 04:08, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Parallel approximation algorithms for bin packing
scientific article

    Statements

    title
    Parallel approximation algorithms for bin packing (English)
    0 references
    author
    Richard J. Anderson
    0 references
    Ernst W. Mayr
    0 references
    Manfred K. Warmuth
    0 references
    publication date
    1989
    0 references
    Mathematics Subject Classification ID
    90C27
    0 references
    65K05
    0 references
    68N25
    0 references
    65Y05
    0 references
    68Q25
    0 references
    zbMATH DE Number
    4110464
    0 references
    zbMATH Keywords
    parallel complexity of polynomial heuristics
    0 references
    bin packing
    0 references
    polynomial approximation algorithms
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1123807&oldid=13173770"
    Powered by MediaWiki