Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/111191
| Title: | Multidimensional on-line bin-packing: An algorithm and its average-case analysis | Authors: | Chang, E.-C. Wang, W. Kankanhalli, M.S. |
Keywords: | Analysis of algorithms Average-case analysis Bin-packing On-line algorithms |
Issue Date: | 19-Nov-1993 | Citation: | Chang, E.-C., Wang, W., Kankanhalli, M.S. (1993-11-19). Multidimensional on-line bin-packing: An algorithm and its average-case analysis. Information Processing Letters 48 (3) : 121-125. ScholarBank@NUS Repository. | 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. © 1993. | Source Title: | Information Processing Letters | URI: | http://scholarbank.nus.edu.sg/handle/10635/111191 | ISSN: | 00200190 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.