Improved online hypercube packing

Authors:
Xin Han;Deshi Ye;Yong Zhou
Affiliations:
School of Informatics, Kyoto University, Kyoto, Japan;College of Computer Science, Zhejiang University, Hangzhou, China;Graduate School of Science, Hokkaido University, Sapporo, Japan
Venue:
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Year:
2006

Citing 10
Cited 2

A simple on-line bin-packing algorithm

Journal of the ACM (JACM)
On-line bin packing in linear time

Journal of Algorithms
An improved lower bound for on-line bin packing algorithms

Information Processing Letters
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Shelf algorithms for on-line strip packing

Information Processing Letters
New Algorithms for Bin Packing

Journal of the ACM (JACM)
On the online bin packing problem

Journal of the ACM (JACM)
Cube packing

Theoretical Computer Science - Latin American theoretical informatics
Optimal online bounded space multidimensional packing

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal Online Algorithms for Multidimensional Packing Problems

SIAM Journal on Computing

Dynamic multi-dimensional bin packing

Journal of Discrete Algorithms
A new upper bound 2.5545 on 2D Online Bin Packing

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.