A note on one-space bounded square packing

DOI10.1016/J.IPL.2015.06.001zbMATH Open1331.68298OpenAlexW1004341668MaRDI QIDQ2353640FDOQ2353640

Paulina Grzegorek, Janusz Januszewski

Publication date: 15 July 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.06.001

zbMATH Keywords

online algorithmstwo-dimensional bin packing

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27)

Cites Work

• On Packing Two-Dimensional Bins
• Online removable square packing
• Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
• ONE-SPACE BOUNDED ALGORITHMS FOR TWO-DIMENSIONAL BIN PACKING
• On-line algorithms for 2-space bounded 2-dimensional bin packing
• Bounded space on-line bin packing: Best is better than first
• Bounds for online bounded space hypercube packing
• Online algorithms for 1-space bounded 2-dimensional bin packing and square packing

Cited In (2)

• Drawer algorithms for 1-space bounded multidimensional hyperbox packing
• Efficient 1-space bounded hypercube packing algorithm

This page was built for publication: A note on one-space bounded square packing

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