A probabilistic analysis of the Next-Fit bin packing algorithm |
| |
| Authors: | Micha Hofri |
| |
| Institution: | Department of Computer Science, The Technion, Haifa, Israel |
| |
| Abstract: | An infinite supply of pieces, with i.i.d. sizes, is packed under the Next-Fit packing procedure. The process An, the number of bins required to pack n pieces, is investigated, and the first two moments are computed when the piece sizes are uniformly distributed. For this special case expressions for the distribution of An are also presented. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
