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}
}
  • J. Håstad
  • Published 2001
  • Mathematics, Computer Science
  • J. ACM
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. 
On the inapproximability of maximum intersection problems
Inapproximability Ratios for Crossing Number
  • R. Pocai
  • Mathematics, Computer Science
  • Electron. Notes Discret. Math.
  • 2017
Improved Inapproximability for TSP
  • M. Lampis
  • Computer Science, Mathematics
  • APPROX-RANDOM
  • 2012
Definable Inapproximability: New Challenges for Duplicator
Definable inapproximability: new challenges for duplicator
Complexity of approximating bounded variants of optimization problems
...
1
2
3
4
5
...

References

SHOWING 1-5 OF 5 REFERENCES
A Parallel Repetition Theorem
  • R. Raz
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1998
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
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