D.S. Turaga, K. Ratakonda, et al.
SCC 2006
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.
D.S. Turaga, K. Ratakonda, et al.
SCC 2006
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering