Packing Random Rectangles of Given Volume
暂无分享,去创建一个
A packing of a collection of rectangles is a disjoint subcollection. In a recent paper, Coffman et al. (1999) prove that the cardinality of a maximum packing of a family ofn random rectangles in [0, 1] 2 is of order n 1/2. We obtain tight bounds on the same quantity when the random rectangles are of a specified volume.
[1] George S. Lueker,et al. Packing random rectangles , 1999 .
[2] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .