Probabilistic analysis of a new class of strip packing algorithms
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 51 (2011) no. 10, pp. 1931-1936

Voir la notice de l'article provenant de la source Math-Net.Ru

A new class of algorithms for online packing of rectangles into a strip is proposed and studied. It is proved that the expectation of the unfilled area for this class of algorithms is $O(N^{2/3})$ in the standard (for this type of problems) probabilistic model for $N$ random rectangles.
@article{ZVMMF_2011_51_10_a15,
     author = {N. N. Kuzyurin and A. I. Pospelov},
     title = {Probabilistic analysis of a~new class of strip packing algorithms},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1931--1936},
     publisher = {mathdoc},
     volume = {51},
     number = {10},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2011_51_10_a15/}
}
TY  - JOUR
AU  - N. N. Kuzyurin
AU  - A. I. Pospelov
TI  - Probabilistic analysis of a new class of strip packing algorithms
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2011
SP  - 1931
EP  - 1936
VL  - 51
IS  - 10
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2011_51_10_a15/
LA  - ru
ID  - ZVMMF_2011_51_10_a15
ER  - 
%0 Journal Article
%A N. N. Kuzyurin
%A A. I. Pospelov
%T Probabilistic analysis of a new class of strip packing algorithms
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2011
%P 1931-1936
%V 51
%N 10
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZVMMF_2011_51_10_a15/
%G ru
%F ZVMMF_2011_51_10_a15
N. N. Kuzyurin; A. I. Pospelov. Probabilistic analysis of a new class of strip packing algorithms. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 51 (2011) no. 10, pp. 1931-1936. http://geodesic.mathdoc.fr/item/ZVMMF_2011_51_10_a15/