Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

SODA
2016
ACM

favoriteEmaildiscussreport

58views Algorithms» more SODA 2016»

Improved Approximation for Vector Bin Packing

8 years 1 months ago

Improved Approximation for Vector Bin Packing

Download www.win.tue.nl

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

Nikhil Bansal, Marek Eliás, Arindam Khan 00

Real-time Traffic

Algorithms | SODA 2016 |

claim paper

Related Content

» Improved Absolute Approximation Ratios for TwoDimensional Packing Problems

» Improved approximation algorithms for multidimensional bin packing problems

» Two for One Tight Approximation of 2D Bin Packing

» Approximation schemes for multidimensional packing

» On Bin Packing with Conflicts

» Bin Packing via Discrepancy of Permutations

» A Polynomial Time Approximation Scheme for the Square Packing Problem

» On strip packing With rotations

» Improved results for a memory allocation problem

» Online Interval Coloring with Packing Constraints

Post Info
More Details (n/a)

Added	09 Apr 2016
Updated	09 Apr 2016
Type	Journal
Year	2016
Where	SODA
Authors	Nikhil Bansal, Marek Eliás, Arindam Khan 0001

Comments (0)