Optimal online bounded space multidimensional packing

zbMATH Open1317.68285MaRDI QIDQ5501262FDOQ5501262

Authors: Leah Epstein, Rob van Stee 

Publication date: 3 August 2015

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

Mathematics Subject Classification ID

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

Cited In (14)

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

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)