Neznakhina Ekaterina Dmitrievna

Publications in Math-Net.Ru

1. Approximation algorithms with constant factors for a series of asymmetric routing problems
   
   Dokl. RAN. Math. Inf. Proc. Upr., 514:1 (2023),  89–97
2. 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
3. Fixed ratio polynomial time approximation algorithm for the Prize-Collecting Asymmetric Traveling Salesman Problem
   
   Ural Math. J., 9:1 (2023),  135–146
4. 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
5. Solvability of the Generalized Traveling Salesman Problem in the class of quasi- and pseudopyramidal tours
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 23:3 (2017),  280–291
6. Approximation Schemes for the Generalized Traveling Salesman Problem
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 22:3 (2016),  283–292
7. A PTAS for the Min-$k$-SCCP in a Euclidean space of arbitrary fixed dimension
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 21:3 (2015),  268–278
8. Polynomial-time approximation scheme for a Euclidean problem on a cycle covering of a graph
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 20:4 (2014),  297–311