DeepAI AI Chat
Log In Sign Up

Harmonic Algorithms for Packing d-dimensional Cuboids Into Bins

by   Eklavya Sharma, et al.

We explore approximation algorithms for the d-dimensional geometric bin packing problem (dBP). Caprara (MOR 2008) gave a harmonic-based algorithm for dBP having an asymptotic approximation ratio (AAR) of T_∞^d-1 (where T_∞≈ 1.691). However, their algorithm doesn't allow items to be rotated. This is in contrast to some common applications of dBP, like packing boxes into shipping containers. We give approximation algorithms for dBP when items can be orthogonally rotated about all or a subset of axes. We first give a fast and simple harmonic-based algorithm having AAR T_∞^d. We next give a more sophisticated harmonic-based algorithm, which we call 𝙷𝙶𝚊𝙿_k, having AAR T_∞^d-1(1+ϵ). This gives an AAR of roughly 2.860 + ϵ for 3BP with rotations, which improves upon the best-known AAR of 4.5. In addition, we study the multiple-choice bin packing problem that generalizes the rotational case. Here we are given n sets of d-dimensional cuboidal items and we have to choose exactly one item from each set and then pack the chosen items. Our algorithms also work for the multiple-choice bin packing problem. We also give fast and simple approximation algorithms for the multiple-choice versions of dD strip packing and dD geometric knapsack.


page 1

page 2

page 3

page 4


Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing

We study the generalized multidimensional bin packing problem (GVBP) tha...

Analysis of the Harmonic Function Used in Bin-Packing

The harmonic function was first introduced by Lee and Lee (JACM 1985) fo...

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

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

Approximation Algorithms for Generalized Multidimensional Knapsack

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

An Asymptotic (4/3+ε)-Approximation for the 2-Dimensional Vector Bin Packing Problem

We study the 2-Dimensional Vector Bin Packing Problem (2VBP), a generali...

On the Fault-Tolerant Online Bin Packing Problem

We study the fault-tolerant variant of the online bin packing problem. S...