Conference paper
On the hardness of approximating multicut and sparsest-cut
Shuchi Chawla, Robert Krauthgamer, et al.
CCC 2005
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
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences
Conference paper
Variable Latent Semantic Indexing
Anirban Dasgupta, Prabhakar Raghavan, et al.
KDD 2005
Conference paper
Proofs, codes, and polynomial-time reducibilities
R. Kumar, D. Sivakumar
CCC 1999