A PTAS for Packing Hypercubes into a Knapsack

by   Klaus Jansen, et al.

We study the d-dimensional hypercube knapsack problem where we are given a set of d-dimensional hypercubes with associated profits, and a knapsack which is a unit d-dimensional hypercube. The goal is to find an axis-aligned non-overlapping packing of a subset of hypercubes such that the profit of the packed hypercubes is maximized. For this problem, Harren (ICALP'06) gave an algorithm with an approximation ratio of (1+1/2^d+epsilon). For d=2, Jansen and Solis-Oba (IPCO'08) showed that the problem admits a polynomial-time approximation scheme (PTAS); Heydrich and Wiese (SODA'17) further improved the running time and gave an efficient polynomial-time approximation scheme (EPTAS). Both the results use structural properties of 2-D packing, which do not generalize to higher dimensions. For d>2, it remains open to obtain a PTAS, and in fact, there has been no improvement since Harren's result. We settle the problem by providing a PTAS. Our main technical contribution is a structural lemma which shows that any packing of hypercubes can be converted into another structured packing such that a high profitable subset of hypercubes is packed into a constant number of special hypercuboids, called V-Boxes and N-Boxes. As a side result, we give an almost optimal algorithm for a variant of the strip packing problem in higher dimensions. This might have applications for other multidimensional geometric packing problems.


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

How does object fatness impact the complexity of packing in d dimensions?

Packing is a classical problem where one is given a set of subsets of Eu...

Maximum Volume Subset Selection for Anchored Boxes

Let B be a set of n axis-parallel boxes in R^d such that each box has a ...

Circle packing in arbitrary domains

We describe an algorithm that allows one to find dense packing configura...

A space-indexed formulation of packing boxes into a larger box

Current integer programming solvers fail to decide whether 12 unit cubes...

Anticoncentration versus the number of subset sums

Let w⃗ = (w_1,…, w_n) ∈ℝ^n. We show that for any n^-2≤ϵ≤ 1, if #{ξ⃗...

There is no APTAS for 2-dimensional vector bin packing: Revisited

We study vector bin packing and vector bin covering problems, multidimen...

Please sign up or login with your details

Forgot password? Click here to reset