Conference paper
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Paper
Best possible approximation algorithm for MAX SAT with cardinality constraint
Abstract
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.
Related
Yixiong Chen, Weichuan Fang
Engineering Analysis with Boundary Elements
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
Fausto Bernardini, Holly Rushmeier
Proceedings of SPIE - The International Society for Optical Engineering