Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
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.
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
Robert F. Gordon, Edward A. MacNair, et al.
WSC 1985
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
Da-Ke He, Ashish Jagmohan, et al.
ISIT 2007