Dynamic Matching with Abandonment: Optimal Guarantees via Static Priority Policies
Resumo indisponível. Consulte o paper original.
PAPER / ARXIV:2609.20610
Roie Levin
RESUMO
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$.
NO MESMO MAPA
Resumo indisponível. Consulte o paper original.