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.
Online algorithms for a dual version of bin packing
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 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.