Conference paper
Single and dual wavelength exposure of photoresist
J. LaRue, C. Ting
Proceedings of SPIE 1989
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
Charles A Micchelli
Journal of Approximation Theory
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
D.S. Turaga, K. Ratakonda, et al.
SCC 2006