Approximating clique is almost NP-complete
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
L. Lovasz
S. Goldwasser
U. Feige
S. Safra
Two prover protocols
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems