Approximating Geometric Knapsack via L-packings

11/21/2017
by   Waldo Gálvez, et al.
0

We study the two-dimensional geometric knapsack problem (2DK) in which we are given a set of n axis-aligned rectangular items, each one with an associated profit, and an axis-aligned square knapsack. The goal is to find a (non-overlapping) packing of a maximum profit subset of items inside the knapsack (without rotating items). The best-known polynomial-time approximation factor for this problem (even just in the cardinality case) is (2 + ϵ) [Jansen and Zhang, SODA 2004]. In this paper, we break the 2 approximation barrier, achieving a polynomial-time (17/9 + ϵ) < 1.89 approximation, which improves to (558/325 + ϵ) < 1.72 in the cardinality case. Essentially all prior work on 2DK approximation packs items inside a constant number of rectangular containers, where items inside each container are packed using a simple greedy strategy. We deviate for the first time from this setting: we show that there exists a large profit solution where items are packed inside a constant number of containers plus one L-shaped region at the boundary of the knapsack which contains items that are high and narrow and items that are wide and thin. As a second major and the main algorithmic contribution of this paper, we present a PTAS for this case. We believe that this will turn out to be useful in future work in geometric packing problems. We also consider the variant of the problem with rotations (2DKR), where items can be rotated by 90 degrees. Also, in this case, the best-known polynomial-time approximation factor (even for the cardinality case) is (2 + ϵ) [Jansen and Zhang, SODA 2004]. Exploiting part of the machinery developed for 2DK plus a few additional ideas, we obtain a polynomial-time (3/2 + ϵ)-approximation for 2DKR, which improves to (4/3 + ϵ) in the cardinality case.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/17/2021

On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem

In two-dimensional geometric knapsack problem, we are given a set of n a...
research
06/26/2019

Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack

The area of parameterized approximation seeks to combine approximation a...
research
03/18/2021

Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More

In the 2-Dimensional Knapsack problem (2DK) we are given a square knapsa...
research
11/21/2017

Approximation Algorithms for Rectangle Packing Problems (PhD Thesis)

In rectangle packing problems we are given the task of placing axis-alig...
research
08/24/2023

An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding

We study the Uniform Cardinality Constrained Multiple Knapsack problem (...
research
03/28/2018

Boundary Labeling for Rectangular Diagrams

Given a set of n points (sites) inside a rectangle R and n points (label...
research
02/11/2021

Approximation Algorithms for Generalized Multidimensional Knapsack

We study a generalization of the knapsack problem with geometric and vec...

Please sign up or login with your details

Forgot password? Click here to reset