Improved online hypercube packing

Xin Han; Deshi Ye; Yong Zhou

Improved online hypercube packing

Data Structures and Algorithms 2016-08-31 v2

Authors: Xin Han , Deshi Ye , Yong Zhou

Abstract

In this paper, we study online multidimensional bin packing problem when all items are hypercubes. Based on the techniques in one dimensional bin packing algorithm Super Harmonic by Seiden, we give a framework for online hypercube packing problem and obtain new upper bounds of asymptotic competitive ratios. For square packing, we get an upper bound of 2.1439, which is better than 2.24437. For cube packing, we also give a new upper bound 2.6852 which is better than 2.9421 by Epstein and van Stee.

Keywords

bin packing online algorithm

Cite

@article{arxiv.cs/0607045,
  title  = {Improved online hypercube packing},
  author = {Xin Han and Deshi Ye and Yong Zhou},
  journal= {arXiv preprint arXiv:cs/0607045},
  year   = {2016}
}