On-line packing regular boxes in the unit cube

Janusz Januszewski

Archivum Mathematicum (1999)

  • Volume: 035, Issue: 2, page 97-101
  • ISSN: 0044-8753

Abstract

top
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.

How to cite

top

Januszewski, Janusz. "On-line packing regular boxes in the unit cube." Archivum Mathematicum 035.2 (1999): 97-101. <http://eudml.org/doc/248366>.

@article{Januszewski1999,
abstract = {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.},
author = {Januszewski, Janusz},
journal = {Archivum Mathematicum},
keywords = {packing; on-line packing; box; packing; on-line packing; box},
language = {eng},
number = {2},
pages = {97-101},
publisher = {Department of Mathematics, Faculty of Science of Masaryk University, Brno},
title = {On-line packing regular boxes in the unit cube},
url = {http://eudml.org/doc/248366},
volume = {035},
year = {1999},
}

TY - JOUR
AU - Januszewski, Janusz
TI - On-line packing regular boxes in the unit cube
JO - Archivum Mathematicum
PY - 1999
PB - Department of Mathematics, Faculty of Science of Masaryk University, Brno
VL - 035
IS - 2
SP - 97
EP - 101
AB - 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.
LA - eng
KW - packing; on-line packing; box; packing; on-line packing; box
UR - http://eudml.org/doc/248366
ER -

References

top
  1. Covering and packing by sequences of convex sets, Discrete Geometry and Convexity, Annals of the New York Academy of Science 440 (1985), 262-278. MR0809212
  2. 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. MR1407805
  3. Problem 74: Ein Intervallüberdeckungsspiel, Math. Semesterber. 41 (1994), 207-210. 
  4. On-line packing sequences of segments, cubes and boxes, Beitr. Alg. Geom. 38 (1997), 377–384. Zbl0889.52025MR1473115
  5. A survey of algorithms for on-line packing and covering by sequences of convex bodies, Bolyai Society Mathematical Studies 6 (1997), 129–157. Zbl0883.52014MR1470756

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.