1. S. Arora, C. Lund, Hardness of approximation, in: D. Hochbaum (Ed.), Approximation Algorithms for NP-Hard Problems, Chapter 10, PWS Publishing Company, Boston, 1997, pp. 399–446.
2. T. Asano, D.P. Williamson, Improved approximation algorithms for MAX SAT, in: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’00, 2000, pp. 96–105.
3. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi. Complexity and Approximation—Combinatorial Optimization Problems and their Approximability Properties, Springer, Berlin, 1999.
4. N. Bansal, V. Raman, Upper bounds for MaxSat: further improved, in: A. Aggarwal, C. Pandu Rangan (Eds.), Proceedings of the 10th Annual Conference on Algorithms and Computation, ISAAC’99, Lecture Notes in Computer Science, Vol. 174, Springer, Berlin, 1999, pp. 247–258.
5. R. Beigel, Finding maximum independent sets in sparse and general graphs, in: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’99, 1999, pp. 856–857.