Nearly tight sample complexity for matroid online contention resolution

DOI10.1137/1.9781611978971.171MaRDI QIDQ7294704zbMATH OpenFDO

Authors Moran Feldman, Ola Svensson, Rico Zenklusen

Publication date 13 July 2026

Full work available at URL https://doi.org/10.1137/1.9781611978971.171

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Nearly tight sample complexity for matroid online contention resolution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294704)