We describe a class of boxes such that every sequence of boxes from this class of total volume smaller than or equal to 1 can be on-line packed in the unit cube.
@article{107686,
author = {Janusz Januszewski},
title = {On-line packing regular boxes in the unit cube},
journal = {Archivum Mathematicum},
volume = {035},
year = {1999},
pages = {97-101},
zbl = {1049.52016},
mrnumber = {1711677},
language = {en},
url = {http://dml.mathdoc.fr/item/107686}
}
Januszewski, Janusz. On-line packing regular boxes in the unit cube. Archivum Mathematicum, Tome 035 (1999) pp. 97-101. http://gdmltest.u-ga.fr/item/107686/
Covering and packing by sequences of convex sets, Discrete Geometry and Convexity, Annals of the New York Academy of Science 440 (1985), 262-278. | MR 0809212
On-line $q$-adic covering by the method of the $n$-th segment and its application to on-line covering by cubes, Beitr. Alg. Geom. 37 (1996) No. 1, 51-56. | MR 1407805
Problem 74: Ein Intervallüberdeckungsspiel, Math. Semesterber. 41 (1994), 207-210.
On-line packing sequences of segments, cubes and boxes, Beitr. Alg. Geom. 38 (1997), 377–384. | MR 1473115 | Zbl 0889.52025
A survey of algorithms for on-line packing and covering by sequences of convex bodies, Bolyai Society Mathematical Studies 6 (1997), 129–157. | MR 1470756 | Zbl 0883.52014