NeurIPS 2020

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint

Meta Review

This paper considers a new problem of optimizing a submodular function subject to a constraint. The algorithmic techniques following mostly from prior work, but the paper addresses a problem of interest that somehow missed being addressed by the community. There is some novelty in the algorithmic and analysis approach that the reviewers appreciated.