Simeon Furrer, Dirk Dahlhaus
ISIT 2005
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.
Simeon Furrer, Dirk Dahlhaus
ISIT 2005
Andrew Skumanich
SPIE Optics Quebec 1993
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
A.R. Gourlay, G. Kaye, et al.
Proceedings of SPIE 1989