New Upper Bounds on The Approximability of 3D Strip Packing
Data Structures and Algorithms
2007-05-23 v1
Abstract
In this paper, we study the 3D strip packing problem in which we are given a list of 3-dimensional boxes and required to pack all of them into a 3-dimensional strip with length 1 and width 1 and unlimited height to minimize the height used. Our results are below: i) we give an approximation algorithm with asymptotic worst-case ratio 1.69103, which improves the previous best bound of by Jansen and Solis-Oba of SODA 2006; ii) we also present an asymptotic PTAS for the case in which all items have {\em square} bases.
Cite
@article{arxiv.cs/0607100,
title = {New Upper Bounds on The Approximability of 3D Strip Packing},
author = {Xin Han and Kazuo Iwama and Guochuan Zhang},
journal= {arXiv preprint arXiv:cs/0607100},
year = {2007}
}
Comments
Submitted to SODA 2007