Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/111191
DC FieldValue
dc.titleMultidimensional on-line bin-packing: An algorithm and its average-case analysis
dc.contributor.authorChang, E.-C.
dc.contributor.authorWang, W.
dc.contributor.authorKankanhalli, M.S.
dc.date.accessioned2014-11-27T09:45:35Z
dc.date.available2014-11-27T09:45:35Z
dc.date.issued1993-11-19
dc.identifier.citationChang, 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.issn00200190
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/111191
dc.description.abstractWe 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.sourceScopus
dc.subjectAnalysis of algorithms
dc.subjectAverage-case analysis
dc.subjectBin-packing
dc.subjectOn-line algorithms
dc.typeArticle
dc.contributor.departmentINSTITUTE OF SYSTEMS SCIENCE
dc.contributor.departmentDEAN'S OFFICE (SCIENCE)
dc.description.sourcetitleInformation Processing Letters
dc.description.volume48
dc.description.issue3
dc.description.page121-125
dc.description.codenIFPLA
dc.identifier.isiutNOT_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.