Name
Abstract | ||
|---|---|---|
We describe an algorithm for on-line d-dimensional bin packing which achieves O(n d+1 d+2 ) average wasted space. This algorithm runs in linear time in the number of items packed. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1016/0020-0190(93)90253-6 | Inf. Process. Lett. |
Keywords | Field | DocType |
average-case analysis,multidimensional on-line bin-packing,linear time,analysis of algorithms,bin packing | Discrete mathematics,Combinatorics,Algorithmics,Analysis of algorithms,Algorithm,Time complexity,Mathematics,Bin packing problem,Case analysis | Journal |
Volume | Issue | ISSN |
48 | 3 | 0020-0190 |
Citations | PageRank | References |
4 | 0.47 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ee-chien Chang | 1 | 835 | 75.36 |
| Weiguo Wang | 2 | 4 | 0.47 |
| Mohan Kankanhalli | 3 | 3825 | 299.56 |