Conference paper
Optimization of real phase-mask performance
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991
We consider the MAX SAT problem with the additional constraint that at most P variables have a true value. We obtain a (1 - e-1)-approximation algorithm for this problem. Feige [6] has proved that for MAX SAT with cardinality constraint with clauses without negations this is the best possible performance guarantee unless P = NP.
F.M. Schellenberg, M. Levenson, et al.
BACUS Symposium on Photomask Technology and Management 1991
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
David L. Shealy, John A. Hoffnagle
SPIE Optical Engineering + Applications 2007
Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007