Please use this identifier to cite or link to this item:
Scopus Web of ScienceĀ® Altmetric
Type: Journal article
Title: 2-Space bounded online cube and hypercube packing
Author: Zhao, X.
Shen, H.
Citation: Tsinghua Science and Technology, 2015; 20(3):255-263
Publisher: Tsinghua University Press
Issue Date: 2015
ISSN: 1007-0214
Statement of
Xiaofan Zhao, Hong Shen
Abstract: We consider the problem of packing d-dimensional cubes into the minimum number of 2-space bounded unit cubes. Given a sequence of items, each of which is a d-dimensional (d >= 3) hypercube with side length not greater than 1 and an infinite number of d-dimensional (d >= 3) hypercube bins with unit length on each side, we want to pack all of the items in the sequence into the minimum number of bins. The constraint is that only two bins are active at anytime during the packing process. Each item should be orthogonally packed without overlapping other items. Items are given in an online manner without the knowledge of or information about the subsequent items. We extend the technique of brick partitioning for square packing and obtain two results: a three-dimensional box and d-dimensional hyperbox partitioning schemes for cube and hypercube packing, respectively. We design 5.43-competitive and 32/21.2(d)-competitive algorithms for cube and hypercube packing, respectively. To the best of our knowledge these are the first known results on 2-space bounded cube and hypercube packing.
Keywords: Hypercube packing; 2-space bounded; online algorithm; asymptotic competitive ratio
Rights: Copyright status unknown
RMID: 0030040671
DOI: 10.1109/TST.2015.7128937
Appears in Collections:Computer Science publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.