Optimal Online Algorithms for Multidimensional Packing Problems

DOI10.1137/S0097539705446895zbMath1092.68047WikidataQ105584150 ScholiaQ105584150MaRDI QIDQ5470698

Leah Epstein, Rob van Stee

Publication date: 1 June 2006

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

online algorithmsoptimal algorithmsmultidimensional bin packing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Related Items (18)

Packing items to feed assembly lines ⋮ Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Dynamic multi-dimensional bin packing ⋮ A note on online hypercube packing ⋮ Drawer algorithms for 1-space bounded multidimensional hyperbox packing ⋮ Efficient 1-space bounded hypercube packing algorithm ⋮ Efficient Approximations for the Online Dispersion Problem ⋮ Online Algorithm for 1-Space Bounded Multi-dimensional Bin Packing ⋮ Online bin packing of squares and cubes ⋮ Bounds for online bounded space hypercube packing ⋮ Online bin packing of squares and cubes ⋮ Two-dimensional online bin packing with rotation ⋮ A bounded space algorithm for online circle packing ⋮ ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING ⋮ Online algorithms for 1-space bounded 2-dimensional bin packing and square packing ⋮ A lower bound for online rectangle packing ⋮ A tight lower bound for the online bounded space hypercube bin packing problem

This page was built for publication: Optimal Online Algorithms for Multidimensional Packing Problems