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

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

.879-approximation algorithms for MAX CUT and MAX 2SAT

Open access
Goemans, Michel X., Williamson, David P.·1994·Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94

Abstract

We present randomized approximation algorithms for the MAX CUT and MAX 2SAT problems that always deliver solutions of expected value at least .87856times the optimal value.These algorithms use a simple and elegant technique that randomly rounds the solution to a nonlinear programming relaxation.This relaxation can be interpreted both as a semidefinite program and as an eigenvalue minimization problem.We then show how to derandomize the algorithm to obtain approximation algorithms with the same performance guarantee of .87856.The previous best-known approximation algorithms for these problems had performance guarantees of ~for MAX CUT and ~for MAX 2SAT.A slight extension of our analysis leads to a .79607-approximationalgorithm for the maximum directed cut problem, where a & approximation algorithm was the previous best-known algorithm.Our algorithm gives the first substantial progress in approximating MAX CUT in nearly twenty years, and, to the best of our knowledge, represents the first use of semidefinite programming in the design of approximation algorithms.

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.1145/195058.195216

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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

Cites

Show all 1 references

Cited by

See all 234

Metadata

Authors
Goemans, M. X., & Williamson, D. P.
Venue
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94
Publisher
ACM Press
Published
1994
Pages
422-431
OpenAlex
W2080905757
Cited by
234
References
1
FWCI
16.12
Type
conference paper
Language
en
Open access
bronze

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: .879-approximation algorithms for MAX CUT and MAX 2SAT. https://app.cochat.ai/papers/10.1145/195058.195216
The paper
Goemans, M. X., & Williamson, D. P. (1994). .879-approximation algorithms for MAX CUT and MAX 2SAT. Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94. https://doi.org/10.1145/195058.195216

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.