Improved Approximation for Vector Bin Packing

We study the d-dimensional vector bin packing problem, a well-studied generalization of bin packing arising in resource allocation and scheduling problems. Here we are given a set of d-dimensional vectors v1, . . . , vn in [0, 1]d , and the goal is to pack them into the least number of bins so that for each bin B, the sum of the vectors in it is at most 1 in every

• Type: Journal
• Year: 2016
• Where: SODA
• Authors: Nikhil Bansal, Marek Eliás, Arindam Khan 0001
• Keywords: Algorithms, SODA 2016