Improving Online Bin Covering with Little Advice
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910999014014976 |
|---|---|
| author | Brodnik, Andrej Nilsson, Bengt J. Vujović, Gordana |
| author_facet | Brodnik, Andrej Nilsson, Bengt J. Vujović, Gordana |
| contents | The online bin covering problem is: given an input sequence of items find a placement of the items in the maximum number of bins such that the sum of the items' sizes in each bin is at least~1. Boyar~{\em et~al}.\@~\cite{boyar2021} present a strategy that with $O(\log \log n)$ bits of advice, where $n$ is the length of the input sequence, achieves a competitive ratio of $8/15\approx0.5333\ldots$. We show that with a strengthened analysis and some minor improvements, the same strategy achieves the significantly improved competitive ratio of~$135/242\approx0.5578\ldots$, still using $O(\log \log n)$ bits of advice. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_09004 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Improving Online Bin Covering with Little Advice Brodnik, Andrej Nilsson, Bengt J. Vujović, Gordana Data Structures and Algorithms F.2.2 The online bin covering problem is: given an input sequence of items find a placement of the items in the maximum number of bins such that the sum of the items' sizes in each bin is at least~1. Boyar~{\em et~al}.\@~\cite{boyar2021} present a strategy that with $O(\log \log n)$ bits of advice, where $n$ is the length of the input sequence, achieves a competitive ratio of $8/15\approx0.5333\ldots$. We show that with a strengthened analysis and some minor improvements, the same strategy achieves the significantly improved competitive ratio of~$135/242\approx0.5578\ldots$, still using $O(\log \log n)$ bits of advice. |
| title | Improving Online Bin Covering with Little Advice |
| topic | Data Structures and Algorithms F.2.2 |
| url | https://arxiv.org/abs/2506.09004 |