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

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( n 5) function value computations.

Saved in:
Bibliographic Details
Published inOperations research letters Vol. 32; no. 1; pp. 41 - 43
Main Author Sviridenko, Maxim
Format Journal Article
LanguageEnglish
Published Elsevier B.V 2004
Subjects
Approximation algorithm
Submodular function
Approximation algorithm
Submodular function
Online AccessGet full text

Cover

More Information
Summary: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( n 5) function value computations.
ISSN:0167-6377
1872-7468
DOI:10.1016/S0167-6377(03)00062-2