Packing random rectangles of given volume

Packing random rectangles of given volume

0.00 Avg rating0 Votes
Article ID: iaor2004400
Country: United States
Volume: 27
Issue: 1
Start Page Number: 244
End Page Number: 252
Publication Date: Feb 2002
Journal: Mathematics of Operations Research
Authors:
Keywords: computational analysis
Abstract:

A packing of a collection of rectangles is a disjoint subcollection. In a recent paper, Coffman et al. prove that the cardinality of a maximum packing of a family of n random rectangles in [0, 1]2 is of order n½. We obtain tight bounds on the same quantity when the random rectangles are of a specified volume.

Reviews

Required fields are marked *. Your email address will not be published.