加载中…
2023-09-24
Online Bin Covering with Exact Parameter Advice
Andrej BrodnikBengt J. NilssonGordana Vujovic
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本