Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998
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
Conference paper
Modeling polarization for Hyper-NA lithography tools and masks
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Ehud Altman, Kenneth R. Brown, et al.
PRX Quantum
John A. Hoffnagle, William D. Hinsberg, et al.
Microlithography 2003