A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
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.
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Yi Zhou, Parikshit Ram, et al.
ICLR 2023
John S. Lew
Mathematical Biosciences
A.R. Gourlay, G. Kaye, et al.
Proceedings of SPIE 1989