Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
Information Processing Letters
O. Goldreich
J.-P. Seifert
S. Safra
(Gap/S)ETH hardness of SVP