Integer Programming and Incidence Treedepth

by   Eduard Eiben, et al.

Recently a strong connection has been shown between the tractability of integer programming (IP) with bounded coefficients on the one side and the structure of its constraint matrix on the other side. To that end, integer linear programming is fixed-parameter tractable with respect to the primal (or dual) treedepth of the Gaifman graph of its constraint matrix and the largest coefficient (in absolute value). Motivated by this, Koutecký, Levin, and Onn [ICALP 2018] asked whether it is possible to extend these result to a more broader class of integer linear programs. More formally, is integer linear programming fixed-parameter tractable with respect to the incidence treedepth of its constraint matrix and the largest coefficient (in absolute value)? We answer this question in negative. In particular, we prove that deciding the feasibility of a system in the standard form, A𝐱 = 𝐛, 𝐥≤𝐱≤𝐮, is 𝖭𝖯-hard even when the absolute value of any coefficient in A is 1 and the incidence treedepth of A is 5. Consequently, it is not possible to decide feasibility in polynomial time even if both the assumed parameters are constant, unless 𝖯=𝖭𝖯. Moreover, we complement this intractability result by showing tractability for natural and only slightly more restrictive settings, namely: (1) treedepth with an additional bound on either the maximum arity of constraints or the maximum number of occurrences of variables and (2) the vertex cover number.


page 1

page 2

page 3

page 4

page 7

page 9

page 10


Subdeterminants and Concave Integer Quadratic Programming

We consider the NP-hard problem of minimizing a separable concave quadra...

Most IPs with bounded determinants can be solved in polynomial time

In 1983 Lenstra showed that an integer program (IP) is fixed parameter t...

The Complexity Landscape of Decompositional Parameters for ILP

Integer Linear Programming (ILP) can be seen as the archetypical problem...

Congruency-Constrained TU Problems Beyond the Bimodular Case

A long-standing open question in Integer Programming is whether integer ...

Parameterized Algorithms for MILPs with Small Treedepth

Solving (mixed) integer linear programs, (M)ILPs for short, is a fundame...

Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming

An intensive line of research on fixed parameter tractability of integer...

On the Integrality Gap of Binary Integer Programs with Gaussian Data

For a binary integer program (IP) max c^𝖳 x, Ax ≤ b, x ∈{0,1}^n, where A...

Please sign up or login with your details

Forgot password? Click here to reset