On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems

Ivan Sergeev

The contention resolution framework is a versatile rounding technique used as a part of the relaxation and rounding approach for solving constrained submodular function maximizatio…