A note on maximizing a submodular set function subject to a knapsack constraint

Maxim Sviridenko

Abstract: In this paper, we obtain an (1−e−1)-approximation algorithm for maximizing a nondecreasing submodular set function subject to a knapsack constraint. This algorithm requires O(n5) function value computations.