22 search results - page 1 / 5 » Tighter bounds of the First Fit algorithm for the bin-packin... |
SODA
1998
ACM
13 years 6 months ago
1998
ACM
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k - 2, k} for all k 3, settling an open question from the recent survey by Coffman, Gar...
FCT
2005
Springer
13 years 10 months ago
2005
Springer
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
AAIM
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we establish a general algorithmic framework between bin packing and strip packing, with which we achieve the same asymptotic bounds by applying bin packing algorithm...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
DAM
2010
12 years 11 months ago
2010