Optimal online bounded space multidimensional packing

MaRDI QIDQ5501262zbMATH OpenFDO

Authors Leah Epstein, Rob van Stee

Publication date 3 August 2015

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Optimal Online Algorithms for Multidimensional Packing Problems
• Algorithms – ESA 2004
• Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing
• Online algorithm for 1-space bounded multi-dimensional bin packing
• New bounds for multidimensional packing

Cited in

(13)

• New bounds for multidimensional packing
• On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis
• Bounds for online bounded space hypercube packing
• Online square and cube packing
• Online Square Packing
• Improved Space for Bounded-Space, On-Line Bin-Packing
• scientific article; zbMATH DE number 2119702 (Why is no real title available?)
• Online Submodular Maximization Problem with Vector Packing Constraint.
• Algorithms – ESA 2004
• Optimal Online Algorithms for Multidimensional Packing Problems
• Dynamic multi-dimensional bin packing
• An on-line algorithm for multidimensional bin packing
• Two-dimensional packing with conflicts

This page was built for publication: Optimal online bounded space multidimensional packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501262)