1 citations · 1 across the 8 of their papers we have counts for
Showing 2024Show all
3 papers · 1 filter
cs.DS2024★ 1 cited
Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
Niv Buchbinder, Moran Feldman
Maximization of submodular functions under various constraints is a fundamental problem that has been studied extensively. A powerful technique that has emerged and has been shown…
cs.DS2024
Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
Niv Buchbinder, Moran Feldman
We study the problem of maximizing a monotone submodular function subject to a matroid constraint, and present for it a deterministic non-oblivious local search algorithm that has…
cs.LG2024
Practical -Approximation for Submodular Maximization Subject to a Cardinality Constraint
Murad Tukan, Loay Mualem, Moran Feldman
Non-monotone constrained submodular maximization plays a crucial role in various machine learning applications. However, existing algorithms often struggle with a trade-off between…