D. Gribanov

activity

20152026

most citedOn

Δ

-Modular Integer Linear Problems In The Canonical Form And Equivalent Problems

16 citations · 74 across the 16 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.CC2021

A faster algorithm for counting the integer points number in $Δ$ -modular polyhedra (corrected version)

D. V. Gribanov, D. S. Malyshev

Let a polytope $P$ be defined by a system $A x \leq b$ . We consider the problem of counting the number of integer points inside $P$ , assuming that $P$ is $Δ$ -modular, where the pol…

cs.CC2021★ 1 cited

An FPTAS for the $Δ$ -modular multidimensional knapsack problem

D. V. Gribanov

It is known that there is no EPTAS for the $m$ -dimensional knapsack problem unless $W [1] = F P T$ . It is true already for the case, when $m = 2$ . But, an FPTAS still can exist for so…

A faster algorithm for counting the integer points number in Δ-modular polyhedra (corrected version)

An FPTAS for the Δ-modular multidimensional knapsack problem

A faster algorithm for counting the integer points number in $Δ$ -modular polyhedra (corrected version)

An FPTAS for the $Δ$ -modular multidimensional knapsack problem