Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/111191
DC Field | Value | |
---|---|---|
dc.title | Multidimensional on-line bin-packing: An algorithm and its average-case analysis | |
dc.contributor.author | Chang, E.-C. | |
dc.contributor.author | Wang, W. | |
dc.contributor.author | Kankanhalli, M.S. | |
dc.date.accessioned | 2014-11-27T09:45:35Z | |
dc.date.available | 2014-11-27T09:45:35Z | |
dc.date.issued | 1993-11-19 | |
dc.identifier.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. | |
dc.identifier.issn | 00200190 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/111191 | |
dc.description.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. | |
dc.source | Scopus | |
dc.subject | Analysis of algorithms | |
dc.subject | Average-case analysis | |
dc.subject | Bin-packing | |
dc.subject | On-line algorithms | |
dc.type | Article | |
dc.contributor.department | INSTITUTE OF SYSTEMS SCIENCE | |
dc.contributor.department | DEAN'S OFFICE (SCIENCE) | |
dc.description.sourcetitle | Information Processing Letters | |
dc.description.volume | 48 | |
dc.description.issue | 3 | |
dc.description.page | 121-125 | |
dc.description.coden | IFPLA | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple 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.