120 search results - page 6 / 24 » On Bin Packing with Conflicts |
160
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
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...
157
click to vote
COCOON
2006
Springer
15 years 8 months ago
2006
Springer
We study the dynamic bin packing problem introduced by Coffman, Garey and Johnson. This problem is a generalization of the bin packing problem in which items may arrive and depart...
140
click to vote
ALGORITHMICA
2010
15 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...
140
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
148
click to vote
COCOON
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we present approximation results for the class constrained bin packing problem that has applications to Video-on-Demand Systems. In this problem we are given bins of...