Multidimensional On-Line Bin-Packing: An Algorithm and its Average-Case Analysis

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.

DOI: 10.1016/0020-0190(93)90253-6

Extracted Key Phrases

Cite this paper

@article{Chang1993MultidimensionalOB, title={Multidimensional On-Line Bin-Packing: An Algorithm and its Average-Case Analysis}, author={Ee-Chien Chang and Weiguo Wang and Mohan S. Kankanhalli}, journal={Inf. Process. Lett.}, year={1993}, volume={48}, pages={121-125} }