Kojevnikov, Arist; Kulikov, Alexander S. A new approach to proving upper bounds for MAX-2-SAT. (English) Zbl 1192.68368 Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22–24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-605-5). 11-17 (2006). For the entire collection see [Zbl 1161.68842]. Cited in 12 Documents MSC: 68Q25 Analysis of algorithms and problem complexity 05C85 Graph algorithms (graph-theoretic aspects) Software:MAX-2-SAT PDF BibTeX XML Cite \textit{A. Kojevnikov} and \textit{A. S. Kulikov}, in: Proceedings of the seventeenth annual ACM-SIAM symposium on discrete algorithms, SODA 2006, Miami, FL, January 22--24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 11--17 (2006; Zbl 1192.68368) Full Text: DOI