Cube packing

Authors:
F. K. Miyazawa;Y. Wakabayashi
Affiliations:
Instituto de Computação, Universidade Estadual de Campinas, Caixa Postal 6176, 13084-971 Campinas-SP, Brazil;Instituto de Matemática e Estatística, Universidade de São Paulo Rua do Matão, 1010, 05508-900 São Paulo-SP, Brazil
Venue:
Theoretical Computer Science - Latin American theoretical informatics
Year:
2003

Citing 3
Cited 6

Algorithms for packing squares: a probabilistic analysis

SIAM Journal on Computing
Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Approximation Algorithms for the Orthogonal Z-Oriented Three-Dimensional Packing Problem

SIAM Journal on Computing

Optimal online bounded space multidimensional packing

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Three-dimensional packings with rotations

Computers and Operations Research
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)
Improved online hypercube packing

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Bounds for online bounded space hypercube packing

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Cube Packing Problem (CPP) is defined as follows. Find a packing of a given list of (small) cubes into a minimum number of (larger) identical cubes. We show first that the approach introduced by Coppersmith and Raghavan for general on-line algorithms for packing problems leads to an on-line algorithm for CPP with asymptotic performance bound 3.954. Then we describe two other off-line approximation algorithms for CPP: one with asymptotic performance bound 3.466 and the other with 2.669. A parametric version of this problem is defined and results on on-line and off-line algorithms are presented. The 2.669 result appears to be the best asymptotic bound currently known.