Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Diskretnyj analiz i issledovanie operacij
Tome 27 (2020)
no. 3
Précédent
Suivant
Tome 27 (2020) no. 3
Sommaire
Planning a defense that minimizes a resource deficit in the worst-case scenario of supply network destruction
V. L. Beresnev
;
A. A. Melnikov
p. 5-27
A polynomial algorithm with asymptotic ratio
$2/3$
for the asymmetric maximization version of the
$m$
-PSP
A. N. Glebov
;
S. G. Toktokhoeva
p. 28-52
On a routing Open Shop Problem on two nodes with unit processing times
M. O. Golovachev
;
A. V. Pyatkin
p. 53-70
Efficient solvability of the weighted vertex coloring problem for some hereditary class of graphs with
$5$
-vertex prohibitions
D. V. Gribanov
;
D. S. Malyshev
;
D. B. Mokeev
p. 71-87
$2$
-Approximation algorithms for two graph clustering problems
V. P. Il'ev
;
S. D. Il'eva
;
A. V. Morshinin
p. 88-108
On the approximation of random variables on a finite chain
A. D. Yashunsky
p. 109-125