Robust secretary and prophet algorithms for packing integer programs

DOI10.1137/1.9781611977073.53MaRDI QIDQ6575126zbMATH OpenFDO

Authors C. J. Argue, Anupam Gupta, Marco Molinaro, Sahil Singla

Publication date 19 July 2024

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• A bicriterion concentration inequality and prophet inequalities for k-fold matroid unions

This page was built for publication: Robust secretary and prophet algorithms for packing integer programs

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