Some Optimal Inapproximability Results

@inproceedings{Hstad1997SomeOI,
  title={Some Optimal Inapproximability Results},
  author={Johan H{\aa}stad},
  booktitle={STOC},
  year={1997}
}
We prove optimal, up to an arbitrary 2 > 0, inapproximability results for Max-Ek-Sat for k ≥ 3, maximizing the number of satisfied linear equations in an over-determined system of linear equations modulo a prime p and Set Splitting. As a consequence of these results we get improved lower bounds for the efficient approximability of many optimization problems studied previously. In particular, for Max-E2-Sat, Max-Cut, Max-di-Cut, and Vertex cover. 

Citations

Publications citing this paper.
SHOWING 1-6 OF 6 CITATIONS