Metraipolis › archive › dc_2be25a45ffd9
An $\tilde Ω(\log n \log m)$ Information-Theoretic Lower Bound for Randomized Online Set Cover — arXiv:2609.20610
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.20610
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T05:44:44.557Z
- SHA-256 of the archived text
19e691821f9f28e97268809760ecd54bd0a4f2f2fceb2cd27fcf90b26d8c6634- Stable URL of this page
https://metraipolis.com/documento/dc_2be25a45ffd9
How to cite
An $\tilde Ω(\log n \log m)$ Information-Theoretic Lower Bound for Randomized Online Set Cover — arXiv:2609.20610 — arXiv (en), https://arxiv.org/abs/2609.20610 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2be25a45ffd9 (Metraipolis archive dc_2be25a45ffd9, sha256 19e691821f9f28e97268809760ecd54bd0a4f2f2fceb2cd27fcf90b26d8c6634)
BibTeX
@misc{dc2be25a45ffd9,
title = {An $tilde Ω(log n log m)$ Information-Theoretic Lower Bound for Randomized Online Set Cover — arXiv:2609.20610},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.20610},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2be25a45ffd9; sha256 19e691821f9f28e97268809760ecd54bd0a4f2f2fceb2cd27fcf90b26d8c6634},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.20610. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We show an information-theoretic lower bound of $\Omega\left(\frac{\log n \log m}{\log \log n + \log \log m}\right)$ for online set cover against randomized algorithms, for all sufficiently large $m$ and $n$ satisfying $\log^2 n \leq m \leq 2^n$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.20610 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T05:08:06.574Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).