Sciweavers

Share
AAIM
2007
Springer

Strip Packing vs. Bin Packing

8 years 11 months ago
Strip Packing vs. Bin Packing
In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithms to strip packing. More precisely we obtain the following results: (1) Any offline bin packing algorithm can be applied to strip packing maintaining the same asymptotic worst-case ratio. Thus using FFD (First Fit Decreasing Height) as a subroutine, we get a practical (simple and fast) algorithm for strip packing with an upper bound 11/9. (2) A class of Harmonic-based algorithms for bin packing can be applied to online strip packing maintaining the same asymptotic competitive ratio. It implies online strip packing admits
Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang
Added 06 Jun 2010
Updated 06 Jun 2010
Type Conference
Year 2007
Where AAIM
Authors Xin Han, Kazuo Iwama, Deshi Ye, Guochuan Zhang
Comments (0)
books