Properties of Δ-modular simplicies and "close" polyhedrons. O(Δ· polylog(Δ))-algorithm for knapsack, proximity and sparsity

by   D. V. Gribanov, et al.

In this work we consider properties of square and "close"-square Δ-modular systems of linear inequalities A x ≤ b. More precisely, we study some class P of "local" polyhedrons defined by Δ-modular systems of the type A x ≤ b that includes simplicies, simple cones, parallelotopes (affine images of cubes) and some more general polyhedrons. We show that for P ∈P the Integer Linear Programming (the ILP) problem max{c^ x x ∈ P ∩Z^n} can be solved by an algorithm with the complexity O(Δ·logΔ· M + poly(n,s)), where M = (m-n) · mult(logΔ) + mult(logc_∞), s is input size and mult(t) is the complexity of t-bit integers multiplication. Additionally, we give estimates on proximity and sparsity of a solution, and show that for fixed A, with high probability, the system A x ≤ b defines polyhedron from P. Another ingredient is a lemma that states equality of rank minors of matricies with orthogonal columns. This lemma gives us an opportunity to transform the systems of the type A x = b, x ≥ 0 to systems of the type A x ≤ b and vise verse, such that structure of sub-determinants states the same. By this way, using the mentioned results about properties of the family P, we give an algorithm for the unbounded knapsack problem with the complexity O(Δ·logΔ· M + poly(n,s)), where Δ = a_∞, M = mult(logΔ) + mult(logc_∞). Additionally, we give estimates on the proximity and sparsity of a solution. Finally, using close technics, we show that the number of unimodular equivalence classes of Δ-modular integrally-empty simplicies is bounded by the function O(Δ^3+logΔ· (2n)^Δ). And give an efficient algorithm to enumerate them.


page 1

page 2

page 3

page 4


A note on the parametric integer programming in the average case: sparsity, proximity, and FPT-algorithms

We consider the Integer Linear Programming (ILP) problem max{c^ x : A x ...

Enumeration and Unimodular Equivalence of Empty Delta-Modular Simplices

Consider a class of simplices defined by systems A x ≤ b of linear inequ...

An Algorithmic Theory of Integer Programming

We study the general integer programming problem where the number of var...

Faster ILP Algorithms for Problems with Sparse Matrices and Their Applications to Multipacking and Multicover Problems in Graphs and Hypergraphs

Let P be a polyhedron, defined by a system A x ≤ b, where A ∈ Z^m × n, r...

Polynomial modular product verification and its implications

Polynomial multiplication is known to have quasi-linear complexity in bo...

On a Simple Connection Between Δ-modular ILP and LP, and a New Bound on the Number of Integer Vertices

Let A ∈ Z^m × n, rank(A) = n, b ∈ Z^m, and P be an n-dimensional polyhed...

Please sign up or login with your details

Forgot password? Click here to reset