Sciweavers

14 search results - page 2 / 3
» Improved Approximation for Vector Bin Packing
Sort
View
CORR
2010
Springer
97views Education» more  CORR 2010»
13 years 6 months ago
Bin Packing via Discrepancy of Permutations
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
Friedrich Eisenbrand, Dömötör P&aac...
IPCO
2008
129views Optimization» more  IPCO 2008»
13 years 7 months ago
A Polynomial Time Approximation Scheme for the Square Packing Problem
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
Klaus Jansen, Roberto Solis-Oba
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
13 years 11 months ago
On strip packing With rotations
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
Klaus Jansen, Rob van Stee
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 6 months ago
Improved results for a memory allocation problem
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
Leah Epstein, Rob van Stee
MFCS
2005
Springer
13 years 11 months ago
Online Interval Coloring with Packing Constraints
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardin...
Leah Epstein, Meital Levy