Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes

We study the multidimensional generalization of the classical Bin Packing problem: Given a collection of d-dimensional rectangles of specified sizes, the goal is to pack them into the minimum number of unit cubes. A long history of results exists for this problem and its special cases. Currently, the best known

• Type: Journal
• Year: 2006
• Where: MOR
• Authors: Nikhil Bansal, José R. Correa, Claire Kenyon, Maxim Sviridenko
• Keywords: Bin Packing Problem, D-dimensional Rectangles, MOR 2006, Multidimensional Generalization