|
|||||
|
|
A note on maximizing a submodular set function subject to a knapsack constraint |
|
| Authors: | Maxim Sviridenko |
| Institution: | IBM, T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA |
| 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. |
| Keywords: | Submodular function Approximation algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ | |