48 citations · 282 across the 41 of their papers we have counts for
4 papers · 1 filter
Maximum Matching sans Maximal Matching: A New Approach for Finding Maximum Matchings in the Data Stream Model
Moran Feldman, Ariel Szarf
The problem of finding a maximum size matching in a graph (known as the maximum matching problem) is one of the most classical problems in computer science. Despite a significant b…
Streaming Submodular Maximization under Matroid Constraints
Moran Feldman, Paul Liu, Ashkan Norouzi-Fard +2
Recent progress in (semi-)streaming algorithms for monotone submodular function maximization has led to tight results for a simple cardinality constraint. However, current techniqu…
Submodular + Concave
Siddharth Mitra, Moran Feldman, Amin Karbasi
It has been well established that first order optimization methods can converge to the maximal objective value of concave functions and provide constant factor approximation guaran…
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…