A modified online bin-covering strategy with O(log log n) advice bits is proven to cover at least 135/242 - O(1/log n) of the optimal number of bins, improving the previous 8/15.
Favrholdt, Shahin Kamali, and Kim S
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Improving Online Bin Covering with Little Advice
A modified online bin-covering strategy with O(log log n) advice bits is proven to cover at least 135/242 - O(1/log n) of the optimal number of bins, improving the previous 8/15.