|
This article is cited in 6 scientific papers (total in 6 papers)
On-line algorithms for packing rectangles into several strips
S. N. Zhuk
Abstract:
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$.
Received: 16.01.2007
Citation:
S. N. Zhuk, “On-line algorithms for packing rectangles into several strips”, Diskr. Mat., 19:4 (2007), 117–131; Discrete Math. Appl., 17:5 (2007), 517–531
Linking options:
https://www.mathnet.ru/eng/dm981https://doi.org/10.4213/dm981 https://www.mathnet.ru/eng/dm/v19/i4/p117
|
Statistics & downloads: |
Abstract page: | 580 | Full-text PDF : | 343 | References: | 41 | First page: | 8 |
|