Article
Full entry |
PDF
(0.2 MB)
Feedback
PDF
(0.2 MB)
Feedback
Keywords:
packing; on-line packing; box
packing; on-line packing; box
Summary:
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.
References:
[1] Groemer, H.: 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
[2] Januszewski, J., Lassak, M., Rote, G., Woeginger, G.: 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
[3] Kuperberg, W.: Problem 74: Ein Intervallüberdeckungsspiel. Math. Semesterber. 41 (1994), 207-210.
[4] Lassak, M.: On-line packing sequences of segments, cubes and boxes. Beitr. Alg. Geom. 38 (1997), 377–384. MR 1473115 | Zbl 0889.52025
[5] Lassak, M.: 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
Search
Partner of
