Skip to main content
SpringerLink
Log in

A theoretical framework of hybrid approaches to MAX SAT

  • Session 4A
  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1997)

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

Included in the following conference series:

Abstract

MAX SAT (the maximum satisfiability problem) is stated as follows: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we present a theoretical framewok of hybrid approaches combining the algorithms of Goemans-Williamson and Yannakakis. This framework leads to a unified analysis of the performance guarantees of proposed algorithms and also leads to a better approximation algorithm with performance guarantee 0.770, if we use a refinement of Yannakakis' algorithm.

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. T. Asano, Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson. Proc. 5th Israel Symposium on Theory of Computing and Systems, 1997, pp.24–37.

    Google Scholar 

  2. T. Asano, T. Ono and T. Hirata, Approximation algorithms for the maximum satisfiability problem. Nordic Journal of Computing, 3 (1996), pp.388–404.

    Google Scholar 

  3. T. Asano, K. Hori, T. Ono and T. Hirata, A refinement of Yannakakis's algorithm for MAX SAT. Information Processing Society of Japan, SIGAL-TR-54-11, 1996.

    Google Scholar 

  4. U. Feige and M. X. Goemans, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. Proc. 3rd Israel Symposium on Theory of Computing and Systems, 1995, pp.182–189.

    Google Scholar 

  5. M. X. Goemans and D. P. Williamson, New /34-approximation algorithms for the maximum satisfiability problem. SIAM J. Disc. Math., 7 (1994), pp.656–666.

    Google Scholar 

  6. M. X. Goemans and D. P. Williamson, Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42 (1995), pp.1115–1145.

    Google Scholar 

  7. M. Yannakakis, On the approximation of maximum satisfiability. Proc. 3rd SODA, 1992, pp.l–9 (and also J. Algorithms, 17 (1994), pp.475–502).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information and System Engineering, Chuo University, Bunkyo-ku, 112, Tokyo, Japan

    Takao Asano & Kuniaki Hori

  2. School of Engineering, Nagoya University, 464-01, Nagoya, Japan

    Takao Ono & Tomio Hirata

Authors
  1. Takao Asano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kuniaki Hori
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Takao Ono
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tomio Hirata
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hon Wai Leong Hiroshi Imai Sanjay Jain

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Asano, T., Hori, K., Ono, T., Hirata, T. (1997). A theoretical framework of hybrid approaches to MAX SAT. In: Leong, H.W., Imai, H., Jain, S. (eds) Algorithms and Computation. ISAAC 1997. Lecture Notes in Computer Science, vol 1350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63890-3_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-63890-3_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63890-2

  • Online ISBN: 978-3-540-69662-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation