  We show an asymptotic 2/3-competitive strategy for the bin covering problem
using O(b+log n) bits of advice, where b is the number of bits used to encode a
rational value and n is the length of the input sequence.
