A randomized sieving algorithm for approximate integer programming
From MaRDI portal
(Redirected from Publication:486990)
Recommendations
- A \(O(1/\epsilon ^{2})^{n }\)-time sieving algorithm for approximate integer programming
- Fast integer programming in fixed dimension
- Minkowski's Convex Body Theorem and Integer Programming
- Las Vegas algorithms for linear and integer programming when the dimension is small
- Some sieving algorithms for lattice problems
Cites work
- scientific article; zbMATH DE number 4204116 (Why is no real title available?)
- scientific article; zbMATH DE number 3046578 (Why is no real title available?)
- A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)
- A sieve algorithm for the shortest lattice vector problem
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
- Complexity of integer quasiconvex polynomial optimization
- Concentration of mass on isotropic convex bodies
- Covering cubes and the closest vector problem
- Covering minima and lattice-point-free convex bodies
- Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
- Entropy and asymptotic geometry of non-symmetric convex bodies
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- Geometric algorithms and combinatorial optimization
- Inequalities for convex bodies and polar reciprocal lattices in \(\mathbb{R}^ n\). II: Application of \(K\)-convexity
- Integer Programming with a Fixed Number of Variables
- Isoperimetric problems for convex bodies and a localization lemma
- Korkin-Zolotarev bases and successive minima of a lattice and its reciprocal lattice
- Minkowski's Convex Body Theorem and Integer Programming
- New bounds in some transference theorems in the geometry of numbers
- On Lovász' lattice reduction and the nearest lattice point problem
- Outline of an algorithm for integer solutions to linear programs
- Parametric integer programming in fixed dimension
- Sampling methods for shortest vectors, closest vectors and successive minima
- Some sieving algorithms for lattice problems
- The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
Cited in
(4)
This page was built for publication: A randomized sieving algorithm for approximate integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486990)
