Improved Online Hypercube Packing
نویسندگان
چکیده
In this paper, we study online multidimensional bin packing problem when all items are hypercubes. Based on the techniques in one dimensional bin packing algorithm Super Harmonic by Seiden, we give a framework for online hypercube packing problem and obtain new upper bounds of asymptotic competitive ratios. For square packing, we get an upper bound of 2.1439, which is better than 2.24437. For cube packing, we also give a new upper bound 2.6852 which is better than 2.9421 by Epstein and van Stee.
منابع مشابه
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
In this paper, we study 1-space bounded multi-dimensional bin packing and hypercube packing. A sequence of items arrive over time, each item is a d-dimensional hyperbox (in bin packing) or hypercube (in hypercube packing), 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 sp...
متن کاملBounds for online bounded space hypercube packing
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. 200...
متن کاملImproved Lower Bounds for Online Hypercube Packing
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...
متن کاملA tight lower bound for an online hypercube packing problem and bounds for prices of anarchy of a related game
We prove a tight lower bound on the asymptotic performance ratio ρ of the bounded space online d-hypercube bin packing problem, solving an open question raised in 2005. In the classic d-hypercube bin packing problem, we are given a sequence of d-dimensional hypercubes and we have an unlimited number of bins, each of which is a d-dimensional unit hypercube. The goal is to pack (orthogonally) the...
متن کاملApproximation algorithms for orthogonal packing problems for hypercubes
Orthogonal packing problems are natural multidimensional generalizations of the classical bin packing problem and knapsack problem and occur in many different settings. The input consists of a set I = {r1, . . . , rn} of d-dimensional rectangular items ri = (ai,1, . . . , ai,d) and a space Q. The task is to pack the items in an orthogonal and non-overlapping manner without using rotations into ...
متن کامل