ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

A Tight (3 / 2 + ε) -Approximation for Skewed Strip Packing

Galvez, W and Grandoni, F and Ameli, AJ and Jansen, K and Khan, A and Rau, M (2023) A Tight (3 / 2 + ε) -Approximation for Skewed Strip Packing. In: Algorithmica .

[img] PDF
alg_2023.pdf - Published Version
Restricted to Registered users only

Download (621kB) | Request a copy
Official URL: https://doi.org/10.1007/s00453-023-01130-2


In the Strip Packing problem, we are given a vertical half-strip [0 , W] × [0 , + ∞) 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. 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, while the current best approximation factor for it is (5 / 3 + ε) . 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, the skewed case is still NP-hard to approximate within a factor (3 / 2 - ε) , and we provide an (almost) tight (3 / 2 + ε) -approximation algorithm.

Item Type: Journal Article
Publication: Algorithmica
Publisher: Springer
Additional Information: The copyright for this article belongs to Springer.
Keywords: Geometry; Polynomial approximation, reductions; 'current; Approximation factor; Best approximations; NP-hard; Partition problem; Rectangle packing; Simple++; Strip packing; Strip packing problem, Approximation algorithms
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 15 Jun 2023 08:54
Last Modified: 15 Jun 2023 08:54
URI: https://eprints.iisc.ac.in/id/eprint/81979

Actions (login required)

View Item View Item