Before revision: We show that a constant factor approximation of the shortest and closest lattice vector problem w.r.t. \ell_{\infty can be computed in time 2^{(0.802 +{\epsilon})\, n}.
After revision: We show that a constant factor approximation of the shortest and closest lattice vector problem w.r.t. any \ell_p-norm can be computed in time 2^{(0.802 +{\epsilon})\, n}.