Efficient 1-space bounded hypercube packing algorithm (Q2205633)

From MaRDI portal
Revision as of 12:14, 17 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient 1-space bounded hypercube packing algorithm
scientific article

    Statements

    title
    Efficient 1-space bounded hypercube packing algorithm (English)
    0 references
    author
    Paulina Grzegorek
    0 references
    Janusz Januszewski
    0 references
    Łukasz Zielonka
    0 references
    published in
    Algorithmica
    0 references
    publication date
    21 October 2020
    0 references
    zbMATH Keywords
    bin packing
    0 references
    online algorithm
    0 references
    asymptotic competitive ratio
    0 references
    cube
    0 references
    hypercube
    0 references
    one-space bounded
    0 references
    cites work

    Identifiers

    Mathematics Subject Classification ID
    68W27
    0 references
    68W40
    0 references
    90C27
    0 references
    zbMATH DE Number
    7263186
    0 references
    OpenAlex ID
    W3033005356
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2205633&oldid=38944288"
    Powered by MediaWiki