Online Bin Covering with Exact Parameter Advice
Andrej Brodnik, Bengt J. Nilsson, Gordana Vujovic
TL;DR
This paper presents a strategy for the online bin covering problem that achieves a 2/3 competitive ratio using a small amount of advice, combining theoretical insights with advice complexity analysis.
Contribution
It introduces an asymptotic 2/3-competitive algorithm for online bin covering that uses O(b+log n) bits of advice, improving understanding of advice complexity in this problem.
Findings
Achieves 2/3 competitive ratio asymptotically.
Uses O(b+log n) bits of advice, where b is bits for rational encoding.
Provides bounds on advice complexity for bin covering.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Auction Theory and Applications · Algorithms and Data Compression