1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2021
Adaptive Sampling for Fast Constrained Maximization of Submodular Function
Francesco Quinzan, Vanja Doskoč, Andreas Göbel +1
Several large-scale machine learning tasks, such as data summarization, can be approached by maximizing functions that satisfy submodularity. These optimization problems often invo…
cs.LG2019★ 1 cited
Non-Monotone Submodular Maximization with Multiple Knapsacks in Static and Dynamic Settings
Vanja Doskoč, Tobias Friedrich, Andreas Göbel +3
We study the problem of maximizing a non-monotone submodular function under multiple knapsack constraints. We propose a simple discrete greedy algorithm to approach this problem, a…