Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
Approximating clique is almost NP-complete
[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
Information Processing Letters
D. Micciancio
O. Goldreich
M. Szegedy
L. Lovasz
S. Goldwasser
U. Feige
(Gap/S)ETH hardness of SVP
Two prover protocols
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems