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 accessAbstract
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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Optimization, approximation, and complexity classes
Papadimitriou, C. H., & Yannakakis, M. (1991) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(91)90023-x · Cited by 1,653
Cited by
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
“A preliminary version of this paper [Goemans and Williamson 1994a] presented a method to obtain deterministic versions of our approximation algorithm with the same performance guarantees.”
Self-citationClique is hard to approximate within n1−ε
Håstad, J. (1999) · Acta Mathematica · doi:10.1007/bf02392825 · Cited by 1,369
The geometry of graphs and some of its algorithmic applications
Linial, N., London, E., & Rabinovich, Y. (1995) · Combinatorica · doi:10.1007/bf01200757 · Cited by 952
On the power of unique 2-prover 1-round games
Khot, S. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.510017 · Cited by 818
Uncertain convex programs: randomized solutions and confidence levels
Calafiore, G., & Campi, M. C. (2005) · Mathematical Programming · doi:10.1007/s10107-003-0499-y · Cited by 659
Clique is hard to approximate within n/sup 1-ε/
Hastad, J. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548522 · Cited by 458
Coherence as constraint satisfaction
Thagard, P. (1998) · Cognitive Science · doi:10.1016/s0364-0213(99)80033-0 · Cited by 352
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
Feige, U., & Goemans, M. (2002) · Proceedings Third Israel Symposium on the Theory of Computing and Systems · doi:10.1109/istcs.1995.377033 · Cited by 328
Self-citationMining newsgroups using networks arising from social behavior
Agrawal, R., Rajagopalan, S., Srikant, R., & Xu, Y. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775227 · Cited by 287
Free bits, PCPs and non-approximability-towards tight results
Bellare, M., Goldreich, O., & Sudan, M. (2002) · Proceedings of IEEE 36th Annual Foundations of Computer Science · doi:10.1109/sfcs.1995.492573 · Cited by 265
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
Rendl, F., Rinaldi, G., & Wiegele, A. (2010) · Mathematical Programming · doi:10.1007/s10107-008-0235-8 · Cited by 264
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
Aumann, Y., & Rabani, Y. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539794285983 · Cited by 260
Energy Minimization via Graph Cuts: Settling What is Possible
Freedman, D., & Drineas, P. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.143 · Cited by 173
“878-approximation algorithm [19]; it is also known from the PCP results of Arora et.”
BackgroundMethod
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
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.