48 citations · 282 across the 41 of their papers we have counts for
6 papers · 1 filter
How Do You Want Your Greedy: Simultaneous or Repeated?
Moran Feldman, Christopher Harshaw, Amin Karbasi
We present SimultaneousGreedys, a deterministic algorithm for constrained submodular maximization. At a high level, the algorithm maintains solutions and greedily updates th…
Continuous Submodular Maximization: Beyond DR-Submodularity
Moran Feldman, Amin Karbasi
In this paper, we propose the first continuous optimization algorithms that achieve a constant factor approximation guarantee for the problem of monotone continuous submodular maxi…
Submodular Maximization in Clean Linear Time
Wenxin Li, Moran Feldman, Ehsan Kazemi +1
In this paper, we provide the first deterministic algorithm that achieves the tight approximation guarantee for submodular maximization under a cardinality (size) constrain…
The One-way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness
Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson +1
We consider the classical problem of maximizing a monotone submodular function subject to a cardinality constraint, which, due to its numerous applications, has recently been studi…
Regularized Submodular Maximization at Scale
Ehsan Kazemi, Shervin Minaee, Moran Feldman +1
In this paper, we propose scalable methods for maximizing a regularized submodular function expressed as the difference between a monotone submodular function an…
Streaming Submodular Maximization under a -Set System Constraint
Ran Haba, Ehsan Kazemi, Moran Feldman +1
In this paper, we propose a novel framework that converts streaming algorithms for monotone submodular maximization into streaming algorithms for non-monotone submodular maximizati…