Approximating clique is almost NP-complete. (1991)

by U Feige, S Goldwasser, L Lovasz, S Safra, M Szegedy
Venue:Proceedings of the 32nd IEEE Annual Symposium on Foundations of Computer Science,