Conceptio › Archive › arXiv (All)
arXiv (All)open access

An $\tilde Ω(\log n \log m)$ Information-Theoretic Lower Bound for Randomized Online Set Cover

Levin, Roie
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
data-structures-and-algorithms
data structures and algorithms
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 1034420
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.