|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 2011, Volume 51, Number 10, Pages 1931–1936
(Mi zvmmf9566)
|
|
|
|
This article is cited in 6 scientific papers (total in 6 papers)
Probabilistic analysis of a new class of strip packing algorithms
N. N. Kuzyurin, A. I. Pospelov Institute for System Programming, Russian Academy of Sciences, ul. Solzhenitsyna 25, Moscow, 109004 Russia
Abstract:
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.
Key words:
strip packing, probabilistic analysis, approximate algorithms.
Received: 11.06.2010
Citation:
N. N. Kuzyurin, A. I. Pospelov, “Probabilistic analysis of a new class of strip packing algorithms”, Zh. Vychisl. Mat. Mat. Fiz., 51:10 (2011), 1931–1936; Comput. Math. Math. Phys., 51:10 (2011), 1817–1822
Linking options:
https://www.mathnet.ru/eng/zvmmf9566 https://www.mathnet.ru/eng/zvmmf/v51/i10/p1931
|
Statistics & downloads: |
Abstract page: | 342 | Full-text PDF : | 84 | References: | 60 | First page: | 10 |
|