Abstract
We study strip packing, which is one of the most classical two-dimensional packing problems: Given a collection of rectangles, the problem is to find a feasible orthogonal packing without rotations into a strip of width 1 and minimum height. In this paper we present an approximation algorithm for the strip packing problem with approximation ratio of 5/3 + ε for any ε > 0. This result significantly narrows the gap between the best known upper bounds of 2 by Schiermeyer and Steinberg and 1.9396 by Harren and van Stee and the lower bound of 3/2. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Harren, R., Jansen, K., Prädel, L., & Van Stee, R. (2011). A (5/3 + ε)-approximation for strip packing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6844 LNCS, pp. 475–487). https://doi.org/10.1007/978-3-642-22300-6_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
