Name
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. |
Year | DOI | Venue |
|---|---|---|
1984 | 10.1016/0196-6774(84)90007-5 | Journal of Algorithms |
Keywords | Field | DocType |
bin packing | Discrete mathematics,Combinatorics,Expression (mathematics),Probabilistic analysis of algorithms,Mathematics,Bin packing problem,Special case,Packing procedure | Journal |
Volume | Issue | ISSN |
5 | 4 | 0196-6774 |
Citations | PageRank | References |
9 | 1.04 | 2 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Micha Hofri | 1 | 342 | 127.96 |