Skip to content
Licensed Unlicensed Requires Authentication Published by De Gruyter January 1, 2006

Approximate algorithms to pack rectangles into several strips

S. N. Zhuk
From the journal

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.

Published Online: 2006-01-01
Published in Print: 2006-01-01

Copyright 2006, Walter de Gruyter