A new upper bound 2.5545 on 2D Online Bin Packing
From MaRDI portal
Publication:3189035
DOI10.1145/2000807.2000818zbMath1295.68133OpenAlexW2029125735MaRDI QIDQ3189035
Xin Han, Yong Zhang, Guo-Chuan Zhang, Francis Y. L. Chin, Hing-Fung Ting
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2000807.2000818
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)
Related Items
Models for video-on-demand scheduling with costs, Online algorithms for 1-space bounded multidimensional bin packing and hypercube packing, Approximation and online algorithms for multidimensional bin packing: a survey, Drawer algorithms for 1-space bounded multidimensional hyperbox packing, Efficient 1-space bounded hypercube packing algorithm, On online algorithms for bin, strip, and box packing, and their worst-case and average-case analysis, Online bin packing of squares and cubes, Online bin packing of squares and cubes, Two-dimensional online bin packing with rotation, Online algorithms for 1-space bounded 2-dimensional bin packing and square packing, A lower bound for online rectangle packing
