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.

翻译：我们展示了在装箱覆盖问题中使用O(b+log n)比特建议的渐近2/3竞争策略，其中b是编码有理数值所用的比特数，n是输入序列的长度。