Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT (1995)
| Venue: | IN PROCEEDINGS OF THE THIRD ISRAEL SYMPOSIUM ON THEORY OF COMPUTING AND SYSTEMS |
| Citations: | 125 - 9 self |
BibTeX
@INPROCEEDINGS{Feige95approximatingthe,
author = {Uriel Feige and Michel Goemans},
title = {Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT},
booktitle = {IN PROCEEDINGS OF THE THIRD ISRAEL SYMPOSIUM ON THEORY OF COMPUTING AND SYSTEMS},
year = {1995},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
It is well known that two prover proof systems are a convenient tool for establishing hardness of approximation results. In this paper, we show that two prover proof systems are also convenient starting points for establishing easiness of approximation results. Our approach combines the Feage-Lovdsz (STOC92) semidefinite programming relaxation of one-round two-prover proof systems, together with rounding techniques for the solutions of semidefinite progmms, as introduced by Goemans and Williamson (STO C94). As a consequence of our approach, we present improved approximation algorithms for MAX 2SAT and MAX DICUT. The algorithms are guamnteed to deliver solutions within a factor of 0.931 of the optimum for MAX 2SAT and within a factor of 0.859 for MAX DICUT, improving upon the guarantees of 0.878 and 0.796 of Goemans and Williamson.
