# Some optimal inapproximability results

@article{Hstad2001SomeOI, title={Some optimal inapproximability results}, author={J. H{\aa}stad}, journal={J. ACM}, year={2001}, volume={48}, pages={798-859} }

We prove optimal, up to an arbitrary ε > 0, inapproximability results for Max-E k-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.

#### Topics from this paper

#### 1,750 Citations

Inapproximability Results for Bounded Variants of Optimization Problems

- Mathematics, Computer Science
- FCT
- 2003

On the inapproximability of maximum intersection problems

- Mathematics, Computer Science
- Inf. Process. Lett.
- 2012

Inapproximability Ratios for Crossing Number

- Mathematics, Computer Science
- Electron. Notes Discret. Math.
- 2017

Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems

- Mathematics, Computer Science
- ICALP
- 2010

Definable Inapproximability: New Challenges for Duplicator

- Mathematics, Computer Science
- CSL
- 2018

Complexity of approximating bounded variants of optimization problems

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2006

#### References

SHOWING 1-5 OF 5 REFERENCES

Free Bits, PCPs, and Nonapproximability-Towards Tight Results

- Mathematics, Computer Science
- SIAM J. Comput.
- 1998

The complexity and approximability of finding feasible subsystems of linear relations

- Theoret. Comput. Sci. 147, 181–210.
- 1995

Computers and Intractability

- W.H. Freeman and Company,
- 1979

Efficient algorithms for the stable set, vertex cover and set packing problems

- Discrete Applied Math,
- 1983