| Article ID: | iaor20043325 |
| Country: | Netherlands |
| Volume: | 32 |
| Issue: | 1 |
| Start Page Number: | 41 |
| End Page Number: | 43 |
| Publication Date: | Jan 2004 |
| Journal: | Operations Research Letters |
| Authors: | Sviridenko Maxim |
| Keywords: | combinatorial analysis |
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(