6 search results - page 1 / 2 » Approximation Schemes for Packing with Item Fragmentation |
WAOA
2005
Springer
13 years 10 months ago
2005
Springer
IPL
2008
13 years 4 months ago
2008
We consider three variants of the open-end bin packing problem. Such variants of bin packing allow the total size of items packed into a bin to exceed the capacity of a bin, provi...
WAOA
2007
Springer
13 years 11 months ago
2007
Springer
We continue the study of bin packing with splittable items and cardinality constraints. In this problem, a set of items must be packed into as few bins as possible. Items may be s...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The bin packing problem is to find the minimum number of bins of size one to pack a list of items with sizes a1,
SODA
2001
ACM
13 years 6 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...