id: 05237625
dt: a
an: 05237625
au: Han, Xin; Ye, Deshi; Zhou, Yong
ti: Improved online hypercube packing.
so: Erlebach, Thomas (ed.) et al., Approximation and online algorithms. 4th
    international workshop, WAOA 2006, Zurich, Switzerland, September
    14‒15, 2006. Revised papers. Berlin: Springer (ISBN
    978-3-540-69513-4/pbk). Lecture Notes in Computer Science 4368, 226-239
    (2007).
py: 2007
pu: Berlin: Springer
la: EN
cc: 
ut: 
ci: 
li: doi:10.1007/11970125_18
ab: Summary: 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.
rv: