Online packing of \(d\)-dimensional boxes into the unit cube (Q2220997)

We say that a sequence of convex bodies of the Euclidean space \(E^d\) can be packed into a container \(C \subset E^d\) being a convex body, provided after applying appropriate rigid motions all of them become subsets of \(C\) with pairwise disjoint interiors. The packing is said to be on-line if the bodies are coming one by one and each is finally packed into \(C\) without any information about the forthcoming bodies from the sequence. The present article quotes the paper [\textit{M. Lassak}, Period. Math. Hung. 34, No. 1--2, 105--110 (1997; Zbl 0892.52012)] where a rectangular parallelotope with edge lengths at least 1 serves as the container packed on-line by any sequence of \(d\)-dimensional rectangular parallelotopes of edge lengths at most \(1\) and the total volume \((1- \frac{1}{2}\sqrt 3)^{d-1}\) times the volume of the container. In the paper under review, the authors consider the special case when the container is the unit \(d\)-dimensional cube and they prove that every sequence of \(d\)-dimensional rectangular parallelotopes of edge lengths at most 1 with the total volume not larger than \((3- 2\sqrt 2)\cdot 3^{-d}\) can be packed online into this cubic container, which improves the quoted estimate for this special case.