ON PACKING UNEQUAL RECTANGLES IN THE UNIT SQUARE

[摘要] This paper improves a previous bound, due to Meir and Moser in [J. Combin. Theory 5 (1968), 126-134] concerning the smallest square into which all of the rectangles of size 1/n x 1/(n + 1), n = 1,2,3,... can be packed. (C) 1994 Academic Press, Inc.

[发布日期] 1994-11-01