A randomized sieving algorithm for approximate integer programming
type: Item
instance of: scholarly article
title: A randomized sieving algorithm for approximate integer programming
zbMATH Open document ID: 1311.90076
author: Daniel Dadush
published in: Algorithmica
publication date: 2015-01-19T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6387688
zbMATH Keywords: integer programming
zbMATH Keywords: lattice problems
zbMATH Keywords: shortest vector problem
zbMATH Keywords: closest vector problem
MaRDI profile type: Publication
full work available at URL: s00453-013-9834-8
OpenAlex ID: W2093079548
cites work: Outline of an algorithm for integer solutions to linear programs
cites work: Integer Programming with a Fixed Number of Variables
cites work: Minkowski's Convex Body Theorem and Integer Programming
cites work: A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)
cites work: A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
cites work: Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
cites work: A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
cites work: Q3352842
cites work: Parametric Integer Programming in Fixed Dimension
cites work: Complexity of integer quasiconvex polynomial optimization
cites work: A sieve algorithm for the shortest lattice vector problem
cites work: Sampling methods for shortest vectors, closest vectors and successive minima
cites work: Some Sieving Algorithms for Lattice Problems
cites work: Covering cubes and the closest vector problem
cites work: Q5785796
cites work: On Lovász' lattice reduction and the nearest lattice point problem
cites work: Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
cites work: Covering minima and lattice-point-free convex bodies
cites work: New bounds in some transference theorems in the geometry of numbers
cites work: Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\). II: Application of \(K\)-convexity
cites work: The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
cites work: Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
cites work: Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
cites work: Geometric algorithms and combinatorial optimization
cites work: Entropy and asymptotic geometry of non-symmetric convex bodies
cites work: Isoperimetric problems for convex bodies and a localization lemma
cites work: Concentration of mass on isotropic convex bodies
DOI: 10.1007/S00453-013-9834-8
description: scientific article; zbMATH DE number 6387688