5 citations · 8 across the 8 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
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…
cs.DS2021★ 1 cited
A Simple Optimal Contention Resolution Scheme for Uniform Matroids
Danish Kashaev, Richard Santiago
Contention resolution schemes (or CR schemes), introduced by Chekuri, Vondrak and Zenklusen, are a class of randomized rounding algorithms for converting a fractional solution to a…