Zobrazeno 1 - 10
of 84
pro vyhledávání: '"Malyshev, D. S."'
In this work we consider the problem of computing the $(\min, +)$-convolution of two sequences $a$ and $b$ of lengths $n$ and $m$, respectively, where $n \geq m$. We assume that $a$ is arbitrary, but $b_i = f(i)$, where $f(x) \colon [0,m) \to \mathbb
Externí odkaz:
http://arxiv.org/abs/2209.04812
Let $A \in Z^{m \times n}$, $rank(A) = n$, $b \in Z^m$, and $P$ be an $n$-dimensional polyhedron, induced by the system $A x \leq b$. It is a known fact that if $F$ is a $k$-face of $P$, then there exist at least $n-k$ linearly independent inequaliti
Externí odkaz:
http://arxiv.org/abs/2203.03907
Autor:
Gribanov, D. V., Malyshev, D. S.
Publikováno v:
Siberian Electronic Mathematical Reports, 19(2), pp. 613-626 (2022)
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 $\Delta$-modular, where the polytope $P$ is called $\Delta$-modular if all the rank sub-determin
Externí odkaz:
http://arxiv.org/abs/2110.01732
Many papers in the field of integer linear programming (ILP, for short) are devoted to problems of the type $\max\{c^\top x \colon A x = b,\, x \in \mathbb{Z}^n_{\geq 0}\}$, where all the entries of $A,b,c$ are integer, parameterized by the number of
Externí odkaz:
http://arxiv.org/abs/2002.01307
Autor:
Chirkov, A. Yu., Gribanov, D. V., Malyshev, D. S., Pardalos, P. M., Veselov, S. I., Zolotykh, N. Yu.
Publikováno v:
J Glob Optim 73, 761-788 (2019)
In this paper, we consider the class of quasiconvex functions and its proper subclass of conic functions. The integer minimization problem of these functions is considered in the paper, assuming that an optimized function is defined by the comparison
Externí odkaz:
http://arxiv.org/abs/1807.02790
Publikováno v:
J Comb Optim 35, 1128-1146 (2018)
In this paper, we present FPT-algorithms for special cases of the shortest lattice vector, integer linear programming, and simplex width computation problems, when matrices included in the problems' formulations are near square. The parameter is the
Externí odkaz:
http://arxiv.org/abs/1712.06309
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Malyshev, D. S.
We completely determine the complexity status of the dominating set problem for hereditary graph classes defined by forbidden induced subgraphs with at most five vertices.
Externí odkaz:
http://arxiv.org/abs/1506.00202
Autor:
Malyshev, D. S., Lobanova, O. O.
We show that determining the chromatic number of a $\{P_5,\bar{P_5}\}$-free graph or a $\{P_5,K_p-e\}$-free graph can be done in polynomial time
Externí odkaz:
http://arxiv.org/abs/1503.02550
Autor:
Kuz'min, N. A.1,2 (AUTHOR) nikita.kuz2000@gmail.com, Malyshev, D. S.1,2 (AUTHOR)
Publikováno v:
Mathematical Notes. Apr2022, Vol. 111 Issue 3/4, p398-406. 9p.