Skip to content

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

A Tight $\widetilde \Omega (\sqrt{m})$ Information-Theoretic Lower Bound for Randomized Online Set Cover

Online set cover is a fundamental problem in online algorithms, admitting a deterministic $O(\log m\log n)$-competitive algorithm, where $m$ is the number of sets and $n$ is the number of elements. This is essentially tight for deterministic algorithms as well as for polynomial-time randomized algorithms assuming $\mat...

Ilan Doron-Arad, J. Naor · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.