11 citations · 48 across the 90 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Bounded-Support Additive Latin Transversals
Antoine Deza, Yan Gerard, Yijun Ma +1
We consider the following additive Latin transversal problem. Given a multiset of elements of and a set of cardinality …
cs.DS2020★ 3 cited
On the Unreasonable Effectiveness of the Greedy Algorithm: Greedy Adapts to Sharpness
Alfredo Torrico, Mohit Singh, Sebastian Pokutta
Submodular maximization has been widely studied over the past decades, mostly because of its numerous applications in real-world problems. It is well known that the standard greedy…
cs.DS2018
Efficient algorithms for robust submodular maximization under matroid constraints
Sebastian Pokutta, Mohit Singh, Alfredo Torrico
In this work, we consider robust submodular maximization with matroid constraints. We give an efficient bi-criteria approximation algorithm that outputs a small family of feasible…