- Authors:
- Joan Boyar,
- Kim S. Larsen,
- Morten N. Nielsen
It is shown that for the Unit Price Bin Packing problem, Worst-Fit has a strictly better competitive ratio than First-Fit. With respect to this problem, First-Fit has previously been proven to have a better accommodating ratio than Worst-Fit. This shows that the accommodating ratio can give different results from the competitive ratio when trying to distinguish between two algorithms, demonstrating the usefulness of the accommodating ratio and accommodating function.
Recommendations
Improved competitive ratio for the matroid secretary problem
SODA '12: Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete algorithmsThe Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presented to an on-line algorithm in a random order. Each element has a weight ...
The relative worst order ratio for online algorithms
We define a new measure for the quality of online algorithms, the relative worst order ratio, using ideas from the max/max ratio [Ben-David and Borodin 1994] and from the random order ratio [Kenyon 1996]. The new ratio is used to compare online ...
The competitive ratio for on-line dual bin packing with restricted input sequences
We consider the On-Line Dual Bin Packing problem where we have a fixed number n of bins of equal size and a sequence of items. The goal is to maximize the number of items that are packed in the bins by an on-line algorithm. An investigation of First-Fit ...