Non-monotone Submodular Optimization: $p$-Matchoid Constraints and Fully Dynamic Setting

Devs

Non-monotone Submodular Optimization: $p$-Matchoid Constraints and Fully Dynamic Setting | Read Paper on Bytez