Bin packing can be solved within 1+epsilon in linear time (Q1164429)

From MaRDI portal
Revision as of 10:00, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Bin packing can be solved within 1+epsilon in linear time
scientific article

    Statements

    title
    Bin packing can be solved within 1+epsilon in linear time (English)
    0 references
    publication date
    1981
    0 references

    Identifiers

    DOI
    10.1007/BF02579456
    0 references
    Mathematics Subject Classification ID
    68R99
    0 references
    68Q25
    0 references
    05B40
    0 references
    zbMATH DE Number
    3763308
    0 references
    Wikidata QID
    Q56212224
    0 references
    OpenAlex ID
    W2145028977
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1164429&oldid=37195504"
    Powered by MediaWiki