### A simple on-line bin-packing algorithmA simple on-line bin-packing algorithm

Access Restriction
Subscribed

 Author Lee, C. C. ♦ Lee, D. T. Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1985 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Abstract The one-dimensional on-line bin-packing problem is considered, A simple $\textit{O}(1)-space$ and $\textit{O}(\textit{n})-time$ algorithm, called $HARMONIC\textit{M},$ is presented. It is shown that this algorithm can achieve a worst-case performance ratio of less than 1.692, which is better than that of the $\textit{O}(\textit{n})-space$ and $\textit{O}(\textit{n}$ log $\textit{n})-time$ algorithm FIRST FIT. Also shown is that 1.691 … is a lower bound for $\textit{all}$ $\textit{0}(1)-space$ on-line bin-packing algorithms. Finally a revised version of HARMONICM , an $\textit{O}(\textit{n})-space$ and $\textit{O}(\textit{n})-$ time algorithm, is presented and is shown to have a worst-case performance ratio of less than 1.636.d ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1985-07-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 32 Issue Number 3 Page Count 11 Starting Page 562 Ending Page 572

#### Open content in new tab

Source: ACM Digital Library