Skip to main content
SpringerLink
Log in

An approximation algorithm for MAX 3-SAT

  • Session 5
  • Conference paper
  • First Online:
Algorithms and Computations (ISAAC 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1004))

Included in the following conference series:

  • 337 Accesses

Abstract

In this paper we present a 0.80-approximation algorithm for MAX 3-SAT. Previously 0.75- or 0.755-approximation algorithms were known for MAX SAT. Thus, we make slight improvement by limiting MAX SAT to MAX 3-SAT. Since approximating MAX 3-SAT within 112/113 is NP-complete, our result means that the best approximation ratio is between 0.80 and 112/113.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Bellare, S. Goldwasser, C. Lund, and A. Russell. Efficient probabilistically checkable proofs and applications to approximation. In Proc. 25th STOC, pages 294–304, 1993.

    Google Scholar 

  2. Michel X. Goemans and David P. Williamson. 878-approximation algorithms for MAX CUT and MAX 2SAT. In Proc. 26th STOC, pages 422–431, 1994.

    Google Scholar 

  3. Michel X. Goemans and David P. Williamson. New 3/4-approximation algorithms for the maximum satisfiability problem. SIAM Journal of Disc. Math., 7(4):656–666, November 1994.

    Google Scholar 

  4. David S. Johnson. Approximation Algorithms for Combinatorial Problems. Journal of Comput. and Sys. Sci., 9:256–278, 1974.

    Google Scholar 

  5. Christos H. Papadimitriou and Mihalis Yannakakis. Optimization, approximation, and complexity classes. In Proc. 20th STOC, pages 229–234, 1988.

    Google Scholar 

  6. Pravin M. Vaidya. A new algorithm for minimizing convex function over convex sets. In Proc. 30th FOCS, pages 338–343, 1989.

    Google Scholar 

  7. Mihalis Yannakakis. On the approximation of maximum satisfiability. In Proc. 3rd SODA, pages 1–9, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering, Nagoya University, Japan

    Takao Ono & Tomio Hirata

  2. Department of Information and System Engineering, Chuo University, Japan

    Takao Asano

Authors
  1. Takao Ono
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tomio Hirata
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Takao Asano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Staples Peter Eades Naoki Katoh Alistair Moffat

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ono, T., Hirata, T., Asano, T. (1995). An approximation algorithm for MAX 3-SAT. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds) Algorithms and Computations. ISAAC 1995. Lecture Notes in Computer Science, vol 1004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015420

Download citation

  • DOI: https://doi.org/10.1007/BFb0015420

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60573-7

  • Online ISBN: 978-3-540-47766-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation