A simple on-line bin-packing algorithm
Journal of the ACM (JACM)
On-line bin packing in linear time
Journal of Algorithms
Improved bounds for harmonic-based bin packing algorithms
Discrete Applied Mathematics - Special volume: combinatorics and theoretical computer science
An improved lower bound for on-line bin packing algorithms
Information Processing Letters
Shelf algorithms for on-line strip packing
Information Processing Letters
New Algorithms for Bin Packing
Journal of the ACM (JACM)
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
Mathematics of Operations Research
On the online bin packing problem
Journal of the ACM (JACM)
An efficient approximation scheme for the one-dimensional bin-packing problem
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
SIGACT news online algorithms column 20: the power of harmony
ACM SIGACT News
Hi-index | 0.00 |
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 an upper bound of 1.58889 on the asymptotic competitive ratio. This significantly improves the previously best bound of 1.6910 and affirmatively answers an open question posed in [5] .