Abstract
The purpose of this talk is to give some idea of the recent progress in obtaining strong, and sometimes tight, inapproximability constants for NP-hard optimization problems. Tight results have been obtained 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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof verification and intractability of approximation problems. Proceedings of 33rd Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, 1992, pp 14–23.
S. Arora and S. Safra. Probabilistic checking of proofs: a new characterization of NP. Proceedings of 33rd Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, 1992, 2–13.
M. Bellare, O. Goldreich and M. Sudan. Free Bits, PCPs and Non-Approximability—Towards tight Results. Proceedings of 36th Annual IEEE Symposium on Foundations of Computer Science, 1995, Milwaukee, pp 422–431. See also a more complete version available from ECCC, Electronic Colloquium on Computational Complexity (http://www.eccc.uni-trier.de/eccc).
M. Bellare, S. Goldwasser, C. Lund and A. Russell. Efficient probabilistically checkable proofs and applications to approximation. Proceedings of the 25th Annual ACM Symposium on Theory of Computation, San Diego, 1993, pp 294–304. (See also Errata sheet in Proceedings of the 26th Annual ACM Symposium on Theory of Computation, Montreal, 1994, pp 820).
M. Bellare and M. Sudan. Improved non-approximability results. Proceedings of 26th Annual ACM Symposium on Theory of Computation, Montreal, 1994, pp 184–193.
M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multiprover interactive proofs. How to remove intractability. Proceedings of the 20th Annual ACM Symposium on Theory of Computation, Chicago, 1988, pp 113–131.
U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy. Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 1996, Vol 43:2, pp 268–292.
L. Fortnow, J. Rompel, and M. Sipser. On the power of Multi-Prover Interactive Protocols. Proceedings 3rd IEEE Symposium on Structure in Complexity Theory, pp 156–161, 1988.
M.R. Garey and D.S. Johnsson. Computers and Intractability. W.H. Freeman and Company, 1979.
J. Håstad. Some optimal inapproximability results. Proceedings of 29th Annual ACM Symposium on Theory of Computation, El Paso, 1997, pp 1–10. See also a more complete version available from ECCC, Electronic Colloquium on Computational Complexity (http://www.eccc.uni-trier.de/eccc).
D.S. Johnsson. Approximation algorithms for combinatorial problems. J. Computer and System Sciences, 1974, Vol 9, pp 256–278.
C. Papadimitriou and M. Yannakakis. Optimization, approximation and complexity classes. Journal of Computer and System Sciences, Vol 43, 1991, pp 425–440.
R. Raz. A parallel repetition theorem. Proceedings of 27th Annual ACM Symposium on Theory of Computation, Las Vegas, 1995, pp 447–456.
L. Trevisan, G. Sorkin, M. Sudan, and D. Williamson. Gadgets, approximation and linear programming. Proceedings of 37th Annual IEEE Symposium on Foundations of Computer Science, Burlington, 1996, pp 617–626.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Håstad, J. (1998). Some recent strong inapproximability results. In: Arnborg, S., Ivansson, L. (eds) Algorithm Theory — SWAT'98. SWAT 1998. Lecture Notes in Computer Science, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054368
Download citation
DOI: https://doi.org/10.1007/BFb0054368
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64682-2
Online ISBN: 978-3-540-69106-8
eBook Packages: Springer Book Archive