2 papers
cs.DS2023
Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid
Richard Santiago, Ivan Sergeev, Rico Zenklusen
The Matroid Secretary Conjecture is a notorious open problem in online optimization. It claims the existence of an -competitive algorithm for the Matroid Secretary Problem (M…
cs.DS2023
Advances on Strictly -Modular IPs
Martin Nägele, Christian Nöbel, Richard Santiago +1
There has been significant work recently on integer programs (IPs) with a constraint marix with bounded subdeterminants.…