Bounds for online bounded space hypercube packing

Authors:
Leah Epstein;Rob Van Stee
Affiliations:
Department of Mathematics, University of Haifa, 31905 Haifa, Israel;Computer Science Department, University of Karlsruhe, Germany
Venue:
Discrete Optimization
Year:
2007

Citing 8
Cited 2

A simple on-line bin-packing algorithm

Journal of the ACM (JACM)
Packing squares into a square

Journal of Parallel and Distributed Computing
Two-dimensional rectangle packing: on-line methods and results

Discrete Applied Mathematics - ARIDAM IV and V
Cube packing

Theoretical Computer Science - Latin American theoretical informatics
Optimal Online Algorithms for Multidimensional Packing Problems

SIAM Journal on Computing
Fast algorithms for bin packing

Journal of Computer and System Sciences
An on-line algorithm for multidimensional bin packing

Operations Research Letters
Multidimensional on-line bin packing: Algorithms and worst-case analysis

Operations Research Letters

Two-dimensional online bin packing with rotation

Theoretical Computer Science
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In hypercube packing, we receive a sequence of hypercubes that need to be packed into unit hypercubes which are called bins. Items arrive online and each item must be placed within its bin without overlapping with other items in that bin. The goal is to minimize the total number of bins used. We present lower and upper bounds for online bounded space hypercube packing in dimensions 2,...,7.