5 citations · 8 across the 8 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2022
Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information
Richard Santiago, Ivan Sergeev, Rico Zenklusen
Random order online contention resolution schemes (ROCRS) are structured online rounding algorithms with numerous applications and links to other well-known online selection proble…
math.OC2021
Congruency-Constrained TU Problems Beyond the Bimodular Case
Martin Nägele, Richard Santiago, Rico Zenklusen
A long-standing open question in Integer Programming is whether integer programs with constraint matrices with bounded subdeterminants are efficiently solvable. An important specia…