Probabilistic analysis of shelf algorithms for packing rectangles into a strip
Diskretnaya Matematika, Tome 18 (2006) no. 1, pp. 76-90
Voir la notice de l'article provenant de la source Math-Net.Ru
In this paper, we consider algorithms to pack rectangles into a strip.
As the main result we present an algorithm that packs rectangles online
and for which the ratio of expected wasted area to expected occupied area
tends to zero as the number of rectangles increases.The research was supported by the Russian Foundation for Basic Research, grants
05–01–00798 and 04–01–00359.
@article{DM_2006_18_1_a5,
author = {N. N. Kuzyurin and A. I. Pospelov},
title = {Probabilistic analysis of shelf algorithms for packing rectangles into a strip},
journal = {Diskretnaya Matematika},
pages = {76--90},
publisher = {mathdoc},
volume = {18},
number = {1},
year = {2006},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_2006_18_1_a5/}
}
TY - JOUR AU - N. N. Kuzyurin AU - A. I. Pospelov TI - Probabilistic analysis of shelf algorithms for packing rectangles into a strip JO - Diskretnaya Matematika PY - 2006 SP - 76 EP - 90 VL - 18 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DM_2006_18_1_a5/ LA - ru ID - DM_2006_18_1_a5 ER -
N. N. Kuzyurin; A. I. Pospelov. Probabilistic analysis of shelf algorithms for packing rectangles into a strip. Diskretnaya Matematika, Tome 18 (2006) no. 1, pp. 76-90. http://geodesic.mathdoc.fr/item/DM_2006_18_1_a5/