AI Chat AI Image Generator AI Video Text to Speech

FPT-algorithms for The Shortest Lattice Vector and Integer Linear Programming Problems

10/01/2017

∙

by D. V. Gribanov, et al.

∙

∙

In this paper, we present FPT-algorithms for special cases of the shortest vector problem (SVP) and the integer linear programming problem (ILP), when matrices included to the problems' formulations are near square. The main parameter is the maximal absolute value of rank minors of matrices included to the problem formulation. Additionally, we present FPT-algorithms with respect to the same main parameter for the problems, when the matrices have no singular rank sub-matrices.

page 1

page 2

page 3

page 4

research

∙ 12/18/2017

FPT-algorithms for some problems related to integer programming

In this paper, we present FPT-algorithms for special cases of the shorte...

0 D. V. Gribanov, et al. ∙

research

∙ 02/03/2020

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 ...

0 D. V. Gribanov, et al. ∙

research

∙ 02/09/2018

The b-bibranching Problem: TDI System, Packing, and Discrete Convexity

In this paper, we introduce the b-bibranching problem in digraphs, which...

0 Kenjiro Takazawa, et al. ∙

research

∙ 09/11/2022

Structured (min,+)-Convolution And Its Applications For The Shortest Vector, Closest Vector, and Separable Nonlinear Knapsack Problems

In this work we consider the problem of computing the (min, +)-convoluti...

0 D. V. Gribanov, et al. ∙

research

∙ 07/07/2023

Absolute value linear programming

We deal with linear programming problems involving absolute values in th...

0 Milan Hladík, et al. ∙

research

∙ 05/13/2019

On Semigroups of Two-Dimensional Upper-Triangular Integer Matrices

We analyze algorithmic problems in finitely generated semigroups of two-...

0 Stefan Jaax, et al. ∙

research

∙ 01/22/2022

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...

0 Dmitry Gribanov, et al. ∙