A note on maximizing a submodular set function subject to a knapsack constraint
Approximate Algorithms for the 0/1 Knapsack Problem