Skip to main content
Conference Proceedings

Recent results in hardness of approximation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1994) 824 LNCS 231-239
DOI: 10.1007/3-540-58218-5_21
2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We survey some of the recent results in proving that approximating some NP-hard optimization problems remains NP-hard. This is a survey paper and it contains no new results.

Cite

CITATION STYLE

APA

Håstad, J. (1994). Recent results in hardness of approximation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 824 LNCS, pp. 231–239). Springer Verlag. https://doi.org/10.1007/3-540-58218-5_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free