|
This article is cited in 39 scientific papers (total in 39 papers)
Approximate algorithms for packing rectangles into several strips
S. N. Zhuk
Abstract:
We consider a problem to pack rectangles into several semi-infinite strips
of certain widths. We suggest two simply realised online algorithms, that is,
algorithms which pack rectangles just at the moments of their arrivals.
It is shown that the accuracy of the former algorithm
cannot be approximated by any absolute constant. The latter algorithm
guarantees a constant multiplicative accuracy, and the obtained estimate
of the multiplicative accuracy is unimprovable. The research was supported by the Russian Foundation for Basic Research, grant
05–01–00798.
Received: 26.01.2005
Citation:
S. N. Zhuk, “Approximate algorithms for packing rectangles into several strips”, Diskr. Mat., 18:1 (2006), 91–105; Discrete Math. Appl., 16:1 (2006), 73–85
Linking options:
https://www.mathnet.ru/eng/dm34https://doi.org/10.4213/dm34 https://www.mathnet.ru/eng/dm/v18/i1/p91
|
Statistics & downloads: |
Abstract page: | 1403 | Full-text PDF : | 726 | References: | 102 | First page: | 2 |
|