文章基本信息

标题：A Tight (3/2+Îµ) Approximation for Skewed Strip Packing
本地全文：下载
作者：Waldo G{'a}lvez ; Fabrizio Grandoni ; Afrouz Jabal Ameli 等
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2020
卷号：176
页码：44:1-44:18
DOI：10.4230/LIPIcs.APPROX/RANDOM.2020.44
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：In the Strip Packing problem, we are given a vertical half-strip [0,W]Ã- [0,+â^Z) and a collection of open rectangles of width at most W. Our goal is to find an axis-aligned (non-overlapping) packing of such rectangles into the strip such that the maximum height OPT spanned by the packing is as small as possible. Strip Packing generalizes classical well-studied problems such as Makespan Minimization on identical machines (when rectangle widths are identical) and Bin Packing (when rectangle heights are identical). It has applications in manufacturing, scheduling and energy consumption in smart grids among others. It is NP-hard to approximate this problem within a factor (3/2-Îµ) for any constant Îµ > 0 by a simple reduction from the Partition problem. The current best approximation factor for Strip Packing is (5/3+Îµ) by Harren et al. [Computational Geometry '14], and it is achieved with a fairly complex algorithm and analysis. It seems plausible that Strip Packing admits a (3/2+Îµ)-approximation. We make progress in that direction by achieving such tight approximation guarantees for a special family of instances, which we call skewed instances. As standard in the area, for a given constant parameter Î´ > 0, we call large the rectangles with width at least Î´ W and height at least Î´ OPT, and skewed the remaining rectangles. If all the rectangles in the input are large, then one can easily compute the optimal packing in polynomial time (since the input can contain only a constant number of rectangles). We consider the complementary case where all the rectangles are skewed. This second case retains a large part of the complexity of the original problem; in particular, it is NP-hard to approximate within a factor (3/2-Îµ) and we provide an (almost) tight (3/2+Îµ)-approximation algorithm.
关键词：strip packing; approximation algorithm