A parameterized approximation scheme for the 2D-Knapsack problem with wide items

by   Michał Pilipczuk, et al.

We study a natural geometric variant of the classic Knapsack problem called 2D-Knapsack: we are given a set of axis-parallel rectangles and a rectangular bounding box, and the goal is to pack as many of these rectangles inside the box without overlap. Naturally, this problem is NP-complete. Recently, Grandoni et al. [ESA'19] showed that it is also W[1]-hard when parameterized by the size k of the sought packing, and they presented a parameterized approximation scheme (PAS) for the variant where we are allowed to rotate the rectangles by 90° before packing them into the box. Obtaining a PAS for the original 2D-Knapsack problem, without rotation, appears to be a challenging open question. In this work, we make progress towards this goal by showing a PAS under the following assumptions: - both the box and all the input rectangles have integral, polynomially bounded sidelengths; - every input rectangle is wide – its width is greater than its height; and - the aspect ratio of the box is bounded by a constant.Our approximation scheme relies on a mix of various parameterized and approximation techniques, including color coding, rounding, and searching for a structured near-optimum packing using dynamic programming.


page 4

page 6

page 7

page 9

page 10

page 11

page 13


Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items

In the Two-dimensional Bin Packing (2BP) problem, we are given a set of ...

Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack

The area of parameterized approximation seeks to combine approximation a...

Closing the gap for pseudo-polynomial strip packing

We study pseudo-polynomial Strip Packing. Given a set of rectangular axi...

An APTAS for Bin Packing with Clique-graph Conflicts

We study the following variant of the classic bin packing problem. The i...

Approximation Algorithms for Rectangle Packing Problems (PhD Thesis)

In rectangle packing problems we are given the task of placing axis-alig...

Online Packing to Minimize Area or Perimeter

We consider online packing problems where we get a stream of axis-parall...

Optimal Rectangle Packing: An Absolute Placement Approach

We consider the problem of finding all enclosing rectangles of minimum a...

Please sign up or login with your details

Forgot password? Click here to reset