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

by   Waldo Gálvez, et al.

In the 2-Dimensional Knapsack problem (2DK) we are given a square knapsack and a collection of n rectangular items with integer sizes and profits. Our goal is to find the most profitable subset of items that can be packed non-overlappingly into the knapsack. The currently best known polynomial-time approximation factor for 2DK is 17/9+ε<1.89 and there is a (3/2+ε)-approximation algorithm if we are allowed to rotate items by 90 degrees [Gálvez et al., FOCS 2017]. In this paper, we give (4/3+ε)-approximation algorithms in polynomial time for both cases, assuming that all input data are integers polynomially bounded in n. Gálvez et al.'s algorithm for 2DK partitions the knapsack into a constant number of rectangular regions plus one L-shaped region and packs items into those in a structured way. We generalize this approach by allowing up to a constant number of more general regions that can have the shape of an L, a U, a Z, a spiral, and more, and therefore obtain an improved approximation ratio. In particular, we present an algorithm that computes the essentially optimal structured packing into these regions.



There are no comments yet.


page 1

page 2

page 3

page 4


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...

Approximating Geometric Knapsack via L-packings

We study the two-dimensional geometric knapsack problem (2DK) in which w...

An APTAS for Bin Packing with Clique-graph Conflicts

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

Algorithms to Approximate Column-Sparse Packing Problems

Column-sparse packing problems arise in several contexts in both determi...

Approximation Algorithms for Generalized Multidimensional Knapsack

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

Harmonic Algorithms for Packing d-dimensional Cuboids Into Bins

We explore approximation algorithms for the d-dimensional geometric bin ...

Breaking the Barrier of 2 for the Storage Allocation Problem

Packing problems are an important class of optimization problems. The pr...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.