Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization

Philip Cervenjak, Junhao Gan, Anthony Wirth

Maximizing a non-negative, monontone, submodular function $f$ over $n$ elements under a cardinality constraint $k$ (SMCC) is a well-studied NP-hard problem. It has important applic…