A randomized sieving algorithm for approximate integer programming
From MaRDI portal
Publication:486990
DOI10.1007/s00453-013-9834-8zbMath1311.90076OpenAlexW2093079548MaRDI QIDQ486990
Publication date: 19 January 2015
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-013-9834-8
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
- Concentration of mass on isotropic convex bodies
- Sampling methods for shortest vectors, closest vectors and successive minima
- On Lovász' lattice reduction and the nearest lattice point problem
- Covering minima and lattice-point-free convex bodies
- Geometric algorithms and combinatorial optimization
- New bounds in some transference theorems in the geometry of numbers
- Entropy and asymptotic geometry of non-symmetric convex bodies
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\). II: Application of \(K\)-convexity
- Isoperimetric problems for convex bodies and a localization lemma
- A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)
- Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
- Complexity of integer quasiconvex polynomial optimization
- A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations
- Integer Programming with a Fixed Number of Variables
- Some Sieving Algorithms for Lattice Problems
- Parametric Integer Programming in Fixed Dimension
- Outline of an algorithm for integer solutions to linear programs
- Minkowski's Convex Body Theorem and Integer Programming
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
- A sieve algorithm for the shortest lattice vector problem
- Covering cubes and the closest vector problem
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
