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 online algorithms for packing problems leads to an online algorithm for CPP with asymptotic performance bound 3.954. Then we describe two other offline 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 online and offline algorithms are presented. We did not find in the literature offline algorithms with asymptotic performance bounds as good as 2.669. © Springer-Verlag Berlin Heidelberg 2000.
Cite
CITATION STYLE
Miyazawa, F. K., & Wakabayashi, Y. (2000). Cube packing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1776 LNCS, pp. 58–67). https://doi.org/10.1007/10719839_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
