D. V. Gribanov | DeepAI

DeepAI AI Chat

Featured Co-authors

D. S. Malyshev
6 publications
N. Yu. Zolotykh
5 publications
P. M. Pardalos
3 publications
S. I. Veselov
3 publications
I. A. Shumilov
2 publications
A. Yu. Chirkov
2 publications
A. Y. Chirkov
1 publication

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

∙ 03/08/2022

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

0 D. V. Gribanov, et al. ∙

∙ 10/04/2021

Faster algorithm for counting of the integer points number in Δ-modular polyhedra

Let a polytope 𝒫 be defined by one of the following ways: (i) 𝒫 = {x ∈...

0 D. V. Gribanov, et al. ∙

∙ 03/12/2021

An FPTAS for the Δ-modular multidimensional knapsack problem

It is known that there is no EPTAS for the m-dimensional knapsack proble...

0 D. V. Gribanov, et al. ∙

∙ 11/01/2020

A polynomial algorithm for minimizing discrete convic functions in fixed dimension

Recently classes of conic and discrete conic functions were introduced. ...

0 S. I. Veselov, et al. ∙

∙ 10/12/2020

On lattice point counting in Δ-modular polyhedra

Let a polyhedron P be defined by one of the following ways: (i) P = {x...

0 D. V. Gribanov, et al. ∙

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

∙ 02/03/2020

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

In this work we consider properties of square and "close"-square Δ-modul...

0 D. V. Gribanov, et al. ∙

∙ 07/08/2018

On the complexity of quasiconvex integer minimization problem

In this paper, we consider the class of quasiconvex functions and its pr...

0 A. Yu. Chirkov, et al. ∙

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

∙ 10/01/2017

The Width and Integer Optimization on Simplices With Bounded Minors of the Constraint Matrices

In this paper, we will show that the width of simplices defined by syste...

0 D. V. Gribanov, et al. ∙

∙ 10/01/2017

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

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

0 D. V. Gribanov, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world