Skip to main content
SpringerLink
Log in

Approximating MIN 2-SAT and MIN 3-SAT

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We obtain substantially improved approximation algorithms for the MIN k-SAT problem, for k = 2,3. More specifically, we obtain a 1.1037-approximation algorithm for the MIN 2-SAT problem, improving a previous 1.5-approximation algorithm, and a 1.2136-approximation algorithm for the MIN 3-SAT problem, improving a previous 1.75-approximation algorithm for the problem. These results are obtained by adapting techniques that were previously used to obtain approximation algorithms for the MAX k-SAT problem. We also obtain some hardness of approximation results.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel

    Adi Avidor & Uri Zwick

Authors
  1. Adi Avidor
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uri Zwick
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Adi Avidor or Uri Zwick.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Avidor, A., Zwick, U. Approximating MIN 2-SAT and MIN 3-SAT. Theory Comput Syst 38, 329–345 (2005). https://doi.org/10.1007/s00224-005-1140-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-005-1140-7

Keywords

Search

Navigation