Computing efficiently the lattice width in any dimension
From MaRDI portal
Publication:638564
DOI10.1016/j.tcs.2011.02.009zbMath1221.68259OpenAlexW2090032031MaRDI QIDQ638564
Lilian Buzer, Émilie Charrier, Fabien Feschet
Publication date: 12 September 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-00827179/file/article_TCS.pdf
Integer programming (90C10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (3)
On factorization invariants and Hilbert functions ⋮ Lattice size and generalized basis reduction in dimension three ⋮ Computing the covering radius of a polytope with an application to lonely runners
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal ellipsoids and maximal simplexes in 3D Euclidean space
- On integer points in polyhedra
- Simultaneous inner and outer approximation of shapes
- Higher dimensional continued fractions
- Finding a shortest vector in a two-dimensional lattice modulo m
- A linear algorithm for integer programming in the plane
- Integer Programming with a Fixed Number of Variables
- Finding Extremal Polygons
- Sieve algorithms for the shortest vector problem are practical
- Efficient Lattice Width Computation in Arbitrary Dimension
- Computing the width of a set
- The Generalized Gauss Reduction Algorithm
- A Polynomial Algorithm for the Two-Variable Integer Programming Problem
- Production Sets with Indivisibilities, Part I: Generalities
- A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
- Computing Two-Dimensional Integer Hulls
This page was built for publication: Computing efficiently the lattice width in any dimension
