Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing

DOI10.1142/S0129054116500076MaRDI QIDQ3186043zbMATH OpenFDO

Authors Janusz Januszewski, Łukasz Zielonka

Publication date 8 August 2016

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054116500076

zbMATH Keywords

competitive analysisonline algorithmstwo-dimensional bin packing

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Combinatorial optimization (90C27)

Cites work

• A simple on-line bin-packing algorithm
• An on-line algorithm for multidimensional bin packing
• Bounded space on-line bin packing: Best is better than first
• Bounds for online bounded space hypercube packing
• Fast algorithms for bin packing
• On-line algorithms for 2-space bounded 2-dimensional bin packing
• On-line grid-packing with a single active grid
• One-space bounded algorithms for two-dimensional bin packing
• Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
• Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing

Cited in

(6)

• Efficient 1-space bounded hypercube packing algorithm
• Drawer algorithms for 1-space bounded multidimensional hyperbox packing
• Online Bin Packing with (1,1) and (2,R) Bins
• Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing
• A new upper bound 2.5545 on 2D Online Bin Packing
• Improved Space for Bounded-Space, On-Line Bin-Packing

This page was built for publication: Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing

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