On approximation algorithms for the minimum satisfiability problem

Information Processing Letters

Volumn 58, Issue 1, 1996, Pages 23-29

  Marathe, M V ^a   Ravi, S S ^b  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b STATE UNIVERSITY OF NEW YORK   (United States)

Author keywords

Analysis of algorithms; Computational complexity

Indexed keywords

EID: 0000745824     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00031-2     Document Type: Article

References (24)

1. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and hardness of approximation problems, in: Proceedings 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, PA (1992) 14-23.
2. B.S. Baker, Approximation algorithms for NP-complete problems on planar graphs, J. ACM 41 (1994) 153-180.
3. M. Bellare, O. Goldreich and M. Sudan, Free bits, PCPs and non-approximability - towards tight results, in: Proceedings 36rd Annual Symposium on Foundations of Computer Science, Milwaukee, WI (1995) 422-431.
4. D. Bertsimas, C. Teo and R. Vohra, New randomized rounding algorithms, Preprint (1995).
5. P. Crescenzi and V. Kann, A compendium of NP optimization problems, Manuscript (1995).
6. U. Feige and M.X. Goemans, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT, in: Proceedings Third Israel Symposium on Theory of Computing and Systems, Tel Aviv (1995).
7. U. Feige, S. Goldwasser, L. Lovasz, S. Safra and M. Szegedy, Approximating clique is almost NP-complete, in: Proceedings 32nd Annual Symposium on Foundations of Computer Science, San Juan, PR (1991) 2-12.
8. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
9. M.R. Garey, D.S. Johnson and L. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1 (1976) 237-267.
10. M.X. Goemans and D.P. Williamson, New 3/4 approximation algorithms for MAXSAT, SIAM J. Discrete Math. 7 (1994) 656-666.
11. M.X. Goemans and D.P. Williamson, .878 approximation algorithms for MAX CUT and MAX 2SAT, in: Proceedings 26th Annual ACM Symposium on Theory of Computing, Montreal, Que. (1994) 422-431.
12. D.S. Hochbaum, Approximation algorithms for the weighted set covering and node cover problems, SIAM J. Comput. 11 (1982) 555-556.
13. D.S. Hochbaum, Personal communication, 1996.
14. D.S. Hochbaum, ed., Approximation Algorithms for NP-Hard Problems (PWS Publishing Company, Boston, MA, to appear).
15. D.S. Hochbaum, N. Meggido, J. Naor and A. Tamir, Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality, Math. Programming 62 (1993) 69-83.
16. D.S. Hochbaum and J. Naor, Simple and fast algorithms for linear and integer programs with two variables per inequality, SIAM J. Comput. 23 (1994) 1179-1192.
17. D.S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. System Sci. 9 (1974) 256-278.
18. R. Kohli, R. Krishnamurti and P. Mirchandani, The minimum satisfiability problem, SIAM J. Discrete Math. 7 (1994) 275-283.
19. D. Lichtenstein, Planar formulae and their uses, SIAM J. Comput. 11 (1982) 329-343.
20. C.H. Papadimitriou, Computational Complexity (Addison-Wesley, Reading, MA, 1994).
21. C.H. Papadimitriou and M. Yannakakis, Optimization, approximation and complexity classes, J. Comput. System Sci. 43 (1991) 425-440.
22. C. Savage, Depth-first search and the vertex cover problem, Inform. Process. Lett. 14 (1982) 233-235.
23. R. Vohra, Personal communication, 1995.
24. M. Yannakakis, On the approximation of maximum satisfiability, J. Algorithms 17 (1994) 475-502.