Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 227

The DOI matches its Crossref record.

New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem

Goemans, Michel X., Williamson, David P.·1994·SIAM Journal on Discrete Mathematics

Abstract

Yannakakis recently presented the first $\frac{3}{4}$-approximation algorithm for the Maximum Satisfiability Problem (MAX SAT). His algorithm makes nontrivial use of solutions to maximum flow problems. New, simple $\frac{3}{4}$-approximation algorithms that apply the probabilistic method/randomized rounding to the solution to a linear programming relaxation of MAX SAT are presented. It is shown that although standard randomized rounding does not give a good approximate result, the best solution of the two given by randomized rounding and a well-known algorithm of Johnson is always within $\frac{3}{4}$ of the optimal solution. It is further shown that an unusual twist on randomized rounding also yields 4-approximation algorithms. As a by-product of the analysis, a tight worst-case analysis of the relative duality gap of the linear programming relaxation is obtained.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/s0895480192243516

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 227

Metadata

Authors
Goemans, M. X., & Williamson, D. P.
Venue
SIAM Journal on Discrete Mathematics
Published
1994-11
Volume
7
Issue
4
Pages
656-666
ISSN
  • 0895-4801 (ISSN-L)
  • 1095-7146
OpenAlex
W2004660767
Cited by
227
References
0
FWCI
7.27
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem. https://app.cochat.ai/papers/10.1137/s0895480192243516
The paper
Goemans, M. X., & Williamson, D. P. (1994). New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem. SIAM Journal on Discrete Mathematics. https://doi.org/10.1137/s0895480192243516

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.