Upper bounds for MaxSat: Further improved

Nikhil Bansal and Venkatesh Raman
Proc. 10th Int. Symp. Algorithms & Computation (ISAAC 1999), Lecture Notes in Computer Science 1741, Alok Aggarwal and C. Pandu Rangan, ed., Springer-Verlag, Dec 1999, pp. 247–258
http://www.cs.cmu.edu/~nikhil/maxsat.ps.gz

Cites:

• 3-coloring in time $O(1.3446^n)$: a no-MIS algorithm