3 papers
cs.CG2025
Improved Approximation Algorithms for Three-Dimensional Bin Packing
Debajyoti Kar, Arindam Khan, Malin Rau
We study two fundamental three-dimensional (3D) geometric packing problems: 3D (Geometric) Bin Packing (3D-BP), and 3D Minimum Volume Bounding Box (3D-MVBB), where given a set of 3…
cs.DS2024
A Tight ()-Approximation Algorithm for Demand Strip Packing
Franziska Eberle, Felix Hommelsheim, Malin Rau +1
We consider the Demand Strip Packing problem (DSP), in which we are given a set of jobs, each specified by a processing time and a demand. The task is to schedule all jobs such tha…
cs.DS2024
Hardness and Tight Approximations of Demand Strip Packing
Klaus Jansen, Malin Rau, Malte Tutas
We settle the pseudo-polynomial complexity of the Demand Strip Packing (DSP) problem: Given a strip of fixed width and a set of items with widths and heights, the items must be pla…