On-line packing squares into n unit squares

• Autorzy: Januszewski J.
• Języki publikacji: EN

Abstrakty

EN

If n ≥ 3, then any sequence of squares of side lengths not greater than 1 whose total area does not exceed ¼(n + 1) can be on-line packed into n unit squares.

Słowa kluczowe

EN

on-line packing; square

• Wydawca: Instytut Matematyczny PAN
• Czasopismo: Bulletin of the Polish Academy of Sciences. Mathematics
• Rocznik: 2010
• Tom: Vol. 58, no 2
• Strony: 137--145
• Opis fizyczny: Bibliogr. 6 poz.

Twórcy

autor

Januszewski J.

• Institute of Mathematics and Physics, University of Technology and Life Sciences, Kaliskiego 7, 85-796 Bydgoszcz, Poland,

Bibliografia

• [1] K. Böröczky, Jr., Finite Packing and Covering, Cambridge Tracts in Math. 154, Cambridge Univ. Press, Cambridge, 2004.
• [2] G. Fejes Tóth and W. Kuperberg, Packing and covering with convex sets, in: Handbook of Convex Geometry, P. M. Gruber and J. M. Wills (eds.), North-Holland, 1993, 799-860.
• [3] X. Han, K. Iwama and G. Zhang, Online removable square packing, Theory Comput. Syst. 43 (2008), 38-55.
• [4] J. Januszewski and M. Lassak, On-line packing sequences of cubes in the unit cube, Geom. Dedicata 67 (1997), 285-293.
• [5] M. Lassak, A survey of algorithms for on-line packing and covering by sequences of convex bodies, in: Intuitive Geometry (Budapest, 1995), Bolyai Soc. Math. Stud. 6, Janos Bolyai Math. Soc., Budapest, 1997, 129-157.
• [6] J. W. Moon and L. Moser, Some packing and covering theorems, Colloq. Math. 17 (1967), 103-110.