On polynomial-factor approximations to the shortest lattice vector length

Ravi Kumar; D. Sivakumar

doi:10.1137/S0895480100379981

SIAM Journal on Discrete Mathematics

Paper

01 Apr 2003

On polynomial-factor approximations to the shortest lattice vector length

View publication

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+ε.

Conference paper

On the hardness of approximating multicut and sparsest-cut

Shuchi Chawla, Robert Krauthgamer, et al.

CCC 2005

Conference paper

Approximate counting of inversions in a data stream

Miklós Ajtai, T.S. Jayram, et al.

STOC 2002

Conference paper

Self-similarity in the web

Stephen Dill, Ravi Kumar, et al.

VLDB 2001

Paper

Link evolution: Analysis and algorithms

Steve Chien, Cynthia Dwork, et al.

Internet Mathematics

View all publications

Abstract

Related

On the hardness of approximating multicut and sparsest-cut

Approximate counting of inversions in a data stream

Self-similarity in the web

Link evolution: Analysis and algorithms