2 papers
cs.DS2019
An Optimal Monotone Contention Resolution Scheme for Bipartite Matchings via a Polyhedral Viewpoint
Simon Bruggmann, Rico Zenklusen
Relaxation and rounding approaches became a standard and extremely versatile tool for constrained submodular function maximization. One of the most common rounding techniques in th…
cs.DS2017
Submodular Maximization through the Lens of Linear Programming
Simon Bruggmann, Rico Zenklusen
The simplex algorithm for linear programming is based on the fact that any local optimum with respect to the polyhedral neighborhood is also a global optimum. We show that a simila…