Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Paper
A note on maximizing a submodular set function subject to a knapsack constraint
Abstract
A note on maximizing a submodular set function subject to a knapsack constraint was presented. An (1-e-1)-approximation algorithm for maximizing a nondecreasing submodular set function was obtained. This algorithm required O(n5) function value computations. The algorithm enumerated all feasible solutions of cardinality one or two.
Related
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Donald Samuels, Ian Stobert
SPIE Photomask Technology + EUV Lithography 2007
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022