SIGACT news online algorithms column 8
ACM SIGACT News
Hi-index | 0.00 |
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.