Online algorithms with advice for the dual bin packing problem

This paper studies the problem of maximizing the number of items packed into n bins, known as the dual bin packing problem, in the advice per request model. In general, no online algorithm has a constant competitive ratio for this problem. An online algorithm with 1 bit of advice per request is shown to be 3/2-competitive. Next, for 0< ε < 1/2 , an online algorithm with advice that is (1/(1-ε )) -competitive and uses O(1/ε ) bits of advice per request is presented.