5 search results - page 1 / 1 » Bin Packing with Rejection Revisited |
ALGORITHMICA
2010
13 years 4 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...
SWAT
2010
Springer
13 years 2 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
ESCAPE
2007
Springer
13 years 10 months ago
2007
Springer
TCS
2010
13 years 2 months ago
2010
We study the following variant of the bin packing problem. We are given a set of items, where each item has a (non-negative) size and a color. We are also given an integer paramet...
CPAIOR
2010
Springer
13 years 9 months ago
2010
Springer
