Geodesic
On-line algorithms for packing rectangles into several strips
Diskretnaya Matematika, Tome 19 (2007) no. 4, pp. 117-131

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

The problem of packing rectangles into several strips is considered. It is shown that for this problem there exist on-line algorithms with multiplicative error asymptotically close to $2e$, where $e$ is the base of the natural logarithm. It is proved that none of the on-line algorithms can have the asymptotic multiplicative error less than $e$. 
@article{DM_2007_19_4_a7,
     author = {S. N. Zhuk},
     title = {On-line algorithms for packing rectangles into several strips},
     journal = {Diskretnaya Matematika},
     pages = {117--131},
     publisher = {mathdoc},
     volume = {19},
     number = {4},
     year = {2007},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2007_19_4_a7/}
}
TY  - JOUR
AU  - S. N. Zhuk
TI  - On-line algorithms for packing rectangles into several strips
JO  - Diskretnaya Matematika
PY  - 2007
SP  - 117
EP  - 131
VL  - 19
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2007_19_4_a7/
LA  - ru
ID  - DM_2007_19_4_a7
ER  - 
%0 Journal Article
%A S. N. Zhuk
%T On-line algorithms for packing rectangles into several strips
%J Diskretnaya Matematika
%D 2007
%P 117-131
%V 19
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2007_19_4_a7/
%G ru
%F DM_2007_19_4_a7
S. N. Zhuk. On-line algorithms for packing rectangles into several strips. Diskretnaya Matematika, Tome 19 (2007) no. 4, pp. 117-131. http://geodesic.mathdoc.fr/item/DM_2007_19_4_a7/