|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
Ksenia Rizhenko, “Improved first player strategy for the zero-sum sequential uncrossing game”, Ural Math. J., 10:1 (2024), 136–146   |
|
2023 |
| 2. |
E. D. Neznakhina, Yu. Yu. Ogorodnikov, K. V. Ryzhenko, M. Yu. Khachay, “Approximation algorithms with constant factors for a series of asymmetric routing problems”, Dokl. RAN. Math. Inf. Proc. Upr., 514:1 (2023), 89–97 ; Dokl. Math., 108:3 (2023), 499–505 |
| 3. |
M. Yu. Khachay, E. D. Neznakhina, K. V. Ryzhenko, “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  ; Proc. Steklov Inst. Math. (Suppl.), 323, suppl. 1 (2023), S121–S132  |
1
|
| 4. |
Ksenia Ryzhenko, Katherine Neznakhina, Michael Khachay, “Fixed ratio polynomial time approximation algorithm for the Prize-Collecting Asymmetric Traveling Salesman Problem”, Ural Math. J., 9:1 (2023), 135–146 |
4
|
|
2022 |
| 5. |
M. Yu. Khachay, E. D. Neznakhina, K. V. Ryzhenko, “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 ; Proc. Steklov Inst. Math. (Suppl.), 319, suppl. 1 (2022), S140–S155  |
5
|
| |
|
|
Contact us: