7 search results - page 2 / 2 » An asymptotic approximation scheme for the concave cost bin ... |
ALGORITHMICA
2010
13 years 8 months ago
2010
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
STOC
2005
ACM
14 years 1 months ago
2005
ACM
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...