Hans Becker, Frank Schmidt, et al.
Photomask and Next-Generation Lithography Mask Technology 2004
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
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
A. Skumanich
SPIE OE/LASE 1992