D.S. Turaga, K. Ratakonda, et al.
SCC 2006
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.
D.S. Turaga, K. Ratakonda, et al.
SCC 2006
Timothy J. Wiltshire, Joseph P. Kirk, et al.
SPIE Advanced Lithography 1998
Shashanka Ubaru, Lior Horesh, et al.
Journal of Biomedical Informatics
Imran Nasim, Michael E. Henderson
Mathematics