Publications in Math-Net.Ru
-
Improved first player strategy for the zero-sum sequential uncrossing game
Ural Math. J., 10:1 (2024), 136–146
-
Approximation algorithms with constant factors for a series of asymmetric routing problems
Dokl. RAN. Math. Inf. Proc. Upr., 514:1 (2023), 89–97
-
Polynomial-Time Approximability of the Asymmetric Problem of Covering a Graph by a Bounded Number of Cycles
Trudy Inst. Mat. i Mekh. UrO RAN, 29:3 (2023), 261–273
-
Fixed ratio polynomial time approximation algorithm for the Prize-Collecting Asymmetric Traveling Salesman Problem
Ural Math. J., 9:1 (2023), 135–146
-
Constant-Factor Approximation Algorithms for a Series of Combinatorial Routing Problems Based on the Reduction to the Asymmetric Traveling Salesman Problem
Trudy Inst. Mat. i Mekh. UrO RAN, 28:3 (2022), 241–258
© , 2024