Ravi Kumar, Prabhakar Raghavan, et al.
Journal of Computer and System Sciences
Paper
On polynomial-factor approximations to the shortest lattice vector length
Abstract
For every constant ε > 0, we obtain a 2O(n(1/2+1/ε)) time randomized algorithm to approximate the length of the shortest vector in an n-dimensional lattice to within a factor of n3+ε.
Related
Conference paper
On the hardness of approximating multicut and sparsest-cut
Shuchi Chawla, Robert Krauthgamer, et al.
CCC 2005
Ronald Fagin, Ravi Kumar, et al.
SIGMOD 2003
Conference paper
Comparing top k lists
Ronald Fagin, Ravi Kumar, et al.
SODA 1998