48 citations · 48 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021
The Power of Subsampling in Submodular Maximization
Christopher Harshaw, Ehsan Kazemi, Moran Feldman +1
We propose subsampling as a unified algorithmic technique for submodular maximization in centralized and online settings. The idea is simple: independently sample elements from the…
cs.DS2019★ 48 cited
Submodular Maximization Beyond Non-negativity: Guarantees, Fast Algorithms, and Applications
Christopher Harshaw, Moran Feldman, Justin Ward +1
It is generally believed that submodular functions -- and the more general class of -weakly submodular functions -- may only be optimized under the non-negativity assumption $f(…