File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Online algorithm for 1-space bounded multi-dimensional bin packing

TitleOnline algorithm for 1-space bounded multi-dimensional bin packing
Authors
Issue Date2011
PublisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/
Citation
Joint Conference of the 5th International Frontiers of Algorithmics Workshop (FAW 2011) and the 7th International Conference on Algorithmic Aspects of Information and Management (AAIM 2011), Jinhua, China, 28-31 May 2011. In Lecture Notes in Computer Science, v. 6681, 2011, p. 308-318 How to Cite?
AbstractIn this paper, we study 1-space bounded multi-dimensional bin packing. A sequence of items arrive over time, each item is a d-dimensional hyperbox and the length of each side is no more than 1. These items must be packed without overlapping into d-dimensional hypercubes with unit length on each side. In d-dimensional space, any two dimensions i and j define a space Pij. When an item arrives, we must pack it into an active bin immediately without any knowledge of the future items, and 90°-rotation on any plane Pij is allowed. The objective is to minimize the total number of bins used for packing all these items in the sequence. In the 1-space bounded variant, there is only one active bin for packing the current item. If the active bin does not have enough space to pack the item, it must be closed and a new active bin is opened. For this problem, we give an online algorithm with competitive ratio 4d, which is the first study on 1-space bounded d-dimensional bin packing. © 2011 Springer-Verlag.
Persistent Identifierhttp://hdl.handle.net/10722/141245
ISSN
2005 Impact Factor: 0.402
2015 SCImago Journal Rankings: 0.252
References

 

DC FieldValueLanguage
dc.contributor.authorZhang, Yen_HK
dc.contributor.authorChin, FYLen_HK
dc.contributor.authorTing, HFen_HK
dc.contributor.authorHan, Xen_HK
dc.contributor.authorChang, Zen_HK
dc.date.accessioned2011-09-23T06:29:02Z-
dc.date.available2011-09-23T06:29:02Z-
dc.date.issued2011en_HK
dc.identifier.citationJoint Conference of the 5th International Frontiers of Algorithmics Workshop (FAW 2011) and the 7th International Conference on Algorithmic Aspects of Information and Management (AAIM 2011), Jinhua, China, 28-31 May 2011. In Lecture Notes in Computer Science, v. 6681, 2011, p. 308-318en_HK
dc.identifier.issn0302-9743en_HK
dc.identifier.urihttp://hdl.handle.net/10722/141245-
dc.description.abstractIn this paper, we study 1-space bounded multi-dimensional bin packing. A sequence of items arrive over time, each item is a d-dimensional hyperbox and the length of each side is no more than 1. These items must be packed without overlapping into d-dimensional hypercubes with unit length on each side. In d-dimensional space, any two dimensions i and j define a space Pij. When an item arrives, we must pack it into an active bin immediately without any knowledge of the future items, and 90°-rotation on any plane Pij is allowed. The objective is to minimize the total number of bins used for packing all these items in the sequence. In the 1-space bounded variant, there is only one active bin for packing the current item. If the active bin does not have enough space to pack the item, it must be closed and a new active bin is opened. For this problem, we give an online algorithm with competitive ratio 4d, which is the first study on 1-space bounded d-dimensional bin packing. © 2011 Springer-Verlag.en_HK
dc.languageengen_US
dc.publisherSpringer Verlag. The Journal's web site is located at http://springerlink.com/content/105633/en_HK
dc.relation.ispartofLecture Notes in Computer Scienceen_HK
dc.rightsThe original publication is available at www.springerlink.comen_US
dc.titleOnline algorithm for 1-space bounded multi-dimensional bin packingen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailZhang, Y: yzhang@cs.hku.hken_HK
dc.identifier.emailChin, FYL: chin@cs.hku.hken_HK
dc.identifier.emailTing, HF: hfting@cs.hku.hk-
dc.identifier.emailHan, X: hanxin.mail@gmail.com-
dc.identifier.emailChang, Z: changzhuo@cmc.hbu.cn-
dc.identifier.authorityChin, FYL=rp00105en_HK
dc.identifier.authorityTing, HF=rp00177en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-3-642-21204-8_33en_HK
dc.identifier.scopuseid_2-s2.0-79957954465en_HK
dc.identifier.hkuros194298en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-79957954465&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume6681en_HK
dc.identifier.spage308en_HK
dc.identifier.epage318en_HK
dc.publisher.placeGermanyen_HK
dc.identifier.scopusauthoridChang, Z=7202170278en_HK
dc.identifier.scopusauthoridHan, X=34872071800en_HK
dc.identifier.scopusauthoridTing, HF=7005654198en_HK
dc.identifier.scopusauthoridChin, FYL=7005101915en_HK
dc.identifier.scopusauthoridZhang, Y=35114314500en_HK
dc.customcontrol.immutablesml 130325-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats