We study the problem of packing a set of n rectangles with weights into a dedicated rectangle so that the weight of the packed rectangles is maximized. We consider the case of large resources, that is. the side length of all rectangles is at most 1 and the side lengths of the dedicated rectangle differ by a factor of at least 1/ε4, for a fixed positive ε > 0. We present an algorithm which finds a rectangle packing of weight at least (1 - ε) of the optimum in time polynomial in n As an application we show a (2 + ε)-approximation algorithm for packing weighted rectangles into k rectangular bins of size (a, b). © 2004 Springer Science + Business Media, Inc.
CITATION STYLE
Fishkin, A. V., Gerber, O., & Jansen, K. (2004). On weighted rectangle packing with large resources. In IFIP Advances in Information and Communication Technology (Vol. 155, pp. 237–250). Springer New York LLC. https://doi.org/10.1007/1-4020-8141-3_20
Mendeley helps you to discover research relevant for your work.