Please use this identifier to cite or link to this item:
Title: Improved Lower Bounds for Online Hypercube Packing
Authors: Heydrich, Sandy
van Stee, Rob
First Published: 5-Jul-2016
Citation: arXiv:1607.01229 [cs.DS]
Abstract: Packing a given sequence of items into as few bins as possible in an online fashion is a widely studied problem. We improve lower bounds for packing hypercubes into bins in two or more dimensions, once for general algorithms (in two dimensions) and once for an important subclass, so-called Harmonic-type algorithms (in two or more dimensions). Lastly, we show that two adaptions of the ideas from the best known one-dimensional packing algorithm to square packing also do not help to break the barrier of 2.
Version: Pre-print
Type: Journal Article
Rights: Copyright © The Author(s), 2016.
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
1607.01229v1.pdfPre-review (submitted draft)256.54 kBAdobe PDFView/Open

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