Author

Moran Feldman

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Stronger Hardness for Submodular Maximization Subject to a Matroid Constraint

Maximizing a submodular function subject to a matroid constraint is a cornerstone problem in combinatorial optimization. The state-of-the-art algorithm for this problem obtains $0.401$-approximation~\cite{buchbinder2024constrained}, and the state-of-the-art hardness result shows that no polynomial time algorithm can ob...

Moran Feldman, A. Kuhnle · 0 citations

Preprint Sep 2026

On Maximizing a Weakly Submodular Function over a Matroid Constraint via the Greedy Algorithm

We consider the problem of approximately maximizing a weakly submodular function using the standard greedy algorithm, which is known to give tight approximation results for such functions under a cardinality constraint. We show that this is not the case for general matroid constraints. For any $\gamma<1$, we give a fam...

Justin Ward, Moran Feldman · 0 citations