Probabilistic analysis for stochastic Rectangle Packing Problem algorithm

Adam Kurpisz
In this paper we consider a modified Rectangle Packing Problem where for each rectangle (module) its width and height come from uniform probability distribution between 0 and 1 - U(0,1). We provide a probabilistic analysis of a simple polynomial-time algorithm for Rectangle Packing Problem. At the end a comparison to the computer simulations is presented.