|Title:||Bin Packing: An Analysis of the Next-fit Algorithm
|Abstract:||An infinite supply of pieces, with i.i.d. sizes, is packed under the Next-Fit pacling procedure. The first two moments of An, the number of bins to pack n pieces are computed when the piece sizes are uniformly distributed. A simple approximate pgf for An is also given, valid for general piece size distribution.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1982/CS/CS0203), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1982
To the main CS technical reports page
Computer science department, Technion