Online Bin Covering with Exact Parameter Advice
Data Structures and Algorithms
2023-09-26 v1
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.
Keywords
Cite
@article{arxiv.2309.13647,
title = {Online Bin Covering with Exact Parameter Advice},
author = {Andrej Brodnik and Bengt J. Nilsson and Gordana Vujovic},
journal= {arXiv preprint arXiv:2309.13647},
year = {2023}
}
Comments
10 pages, 2 figure, submitted to Informatica