On Integer Programming and Convolution

03/13/2018
by   Klaus Jansen, et al.
0

Integer programs with a fixed number of constraints can be solved in pseudo-polynomial time. We present a surprisingly simple algorithm and matching conditional lower bounds. Consider an IP in standard form {c^T x : A x = b, x∈ Z^n_> 0}, where A∈ Z^m× n, b∈ Z^m and c∈ Z^n. Let Δ be an upper bound on the absolute values in A. We show that this IP can be solved in time O(mΔ)^2m·( b _∞). The previous best algorithm has a running time of n· O(mΔ)^2m· b _1^2. The hardness of (min, +)-convolution has been used to prove conditional lower bounds on a number of polynomially solvable problems. We show that improving our algorithm for IPs of any fixed number of constraints is equivalent to improving (min, +)-convolution. More precisely, for any fixed m there exists an algorithm for solving IPs with m constraints in time O(m(Δ + b _∞))^2m-δ for some δ > 0, if and only if there is a truly sub-quadratic algorithm for (min, +)-convolution. For the feasibility problem, where the IP has no objective function, we improve the running time to O(mΔ)^m(Δ) (Δ + b _∞). We also give a matching lower bound here: For every fixed m and δ > 0 there is no algorithm for testing feasibility of IPs with m constraints in time n^O(1)· O(m(Δ + b _∞))^m - δ unless the SETH is false.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/03/2018

Tight complexity lower bounds for integer linear programming with few constraints

We consider the ILP Feasibility problem: given an integer linear program...
research
04/15/2019

Most IPs with bounded determinants can be solved in polynomial time

In 1983 Lenstra showed that an integer program (IP) is fixed parameter t...
research
08/22/2023

Simple and Faster Algorithms for Knapsack

In this paper, we obtain a number of new simple pseudo-polynomial time a...
research
08/12/2021

On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius Problem

Consider positive integral solutions x ∈ℤ^n+1 to the equation a_0 x_0 + ...
research
08/15/2023

A Nearly Quadratic-Time FPTAS for Knapsack

We investigate polynomial-time approximation schemes for the classic 0-1...
research
08/14/2023

(1-ε)-Approximation of Knapsack in Nearly Quadratic Time

Knapsack is one of the most fundamental problems in theoretical computer...
research
10/25/2021

Collapsing the Tower – On the Complexity of Multistage Stochastic IPs

In this paper we study the computational complexity of solving a class o...

Please sign up or login with your details

Forgot password? Click here to reset