Average-case analyses of first fit and random fit bin packing
نویسندگان
چکیده
منابع مشابه
Average-Case Analysis of First Fit and Random Fit Bin Packing
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, Garey, and Johnson [3]. Our proof generalizes the multi-dimensional Markov chain analysis used by Kenyon, Rabani, and Sinclair to prove that Best Fit is also stable under these distributions [11]. Our proof is motivated...
متن کاملBest-fit Bin-packing with Random Order Ecole Normale Supérieure De Lyon Best-fit Bin-packing with Random Order Best-fit Bin-packing with Random Order
Best t is the best known algorithm for on line bin packing in the sense that no algorithm is known to behave better both in the worst case and in the average uniform case In practice Best t appears to perform within a few percent of optimal In this paper we study the expected performance ratio taking the worst case multiset of items L and assuming that the elements of L are inserted in random o...
متن کاملBest-Fit Bin-Packing with Random Order
Best-t is the best known algorithm for on-line bin-packing, in the sense that no algorithm is known to behave better both in the worst case (when Best-t has performance ratio 1.7) and in the average uniform case, with items drawn uniformly in the interval 0; 1] (then Best-t has expected wasted space O(n 1=2 (log n) 3=4)). In practical applications, Best-t appears to perform within a few percent...
متن کاملFirst Fit bin packing: A tight analysis
In the bin packing problem we are given an instance consisting of a sequence of items with sizes between 0 and 1. The objective is to pack these items into the smallest possible number of bins of unit size. FirstFit algorithm packs each item into the first bin where it fits, possibly opening a new bin if the item cannot fit into any currently open bin. In early seventies it was shown that the a...
متن کاملDivergence-proving Techniques for Best Fit Bin Packing and Random Fit
This work discusses my attempts to extend Kenyon and Mitzenmacher’s technique for proving diveregnce of the online approximation algorithm Best Fit to Random Fit – another approximation algorithm for the well-known NP-hard problem of bin packing. In specific, the paper goes over Kenyon and Mitzenmacher’s recent advances on divergence of the waste of Best Fit bin packing for the skewed distribut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2000
ISSN: 1042-9832,1098-2418
DOI: 10.1002/(sici)1098-2418(200005)16:3<240::aid-rsa2>3.0.co;2-v