Khachay Mikhail Yurevich

Publications in Math-Net.Ru

1. Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms
   
   Zh. Vychisl. Mat. Mat. Fiz., 64:6 (2024),  940–958
2. Approximation algorithms with constant factors for a series of asymmetric routing problems
   
   Dokl. RAN. Math. Inf. Proc. Upr., 514:1 (2023),  89–97
3. 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
4. Fixed ratio polynomial time approximation algorithm for the Prize-Collecting Asymmetric Traveling Salesman Problem
   
   Ural Math. J., 9:1 (2023),  135–146
5. Trusted artificial intelligence: challenges and promising solutions
   
   Dokl. RAN. Math. Inf. Proc. Upr., 508 (2022),  13–18
6. 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
7. Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension
   
   Zh. Vychisl. Mat. Mat. Fiz., 61:7 (2021),  1206–1219
8. Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension
   
   Dokl. RAN. Math. Inf. Proc. Upr., 493 (2020),  74–80
9. Haimovich-Rinnooy Kan polynomial-time approximation scheme for the CVRP in metric spaces of a fixed doubling dimension
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 25:4 (2019),  235–248
10. Polynomial time approximation scheme for the capacitated vehicle routing problem with time windows
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 24:3 (2018),  233–246
11. Attainable best guarantee for the accuracy of $k$-medians clustering in $[0,1]$
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 23:4 (2017),  301–310
12. 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
13. Approximation Schemes for the Generalized Traveling Salesman Problem
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 22:3 (2016),  283–292
14. Approximability of the optimal routing problem in finite-dimensional Euclidean spaces
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 22:2 (2016),  292–303
15. On parameterized complexity of the hitting set problem for axis-parallel squares intersecting a straight line
    
    Ural Math. J., 2:2 (2016),  117–126
16. An exact algorithm with linear complexity for a problem of visiting megalopolises
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 21:3 (2015),  309–317
17. Scheme of boosting in the problems of combinatorial optimization induced by the collective training algorithms
    
    Avtomat. i Telemekh., 2014, no. 4,  81–93
18. 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
19. Efficient algorithms with performance estimates for some problems of finding several cliques in a complete undirected weighted graph
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 20:2 (2014),  99–112
20. Boosting and the polynomial approximability of the problem on a minimum affine separating committee
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 19:2 (2013),  231–236
21. $2$-approximate algorithm for finding a clique with minimum weight of vertices and edges
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 19:2 (2013),  134–143
22. Topological properties of measurable structures and sufficient conditions for uniform convergence of frequencies to probabilities
    
    Avtomat. i Telemekh., 2012, no. 2,  89–98
23. The computational complexity and approximability of a series of geometric covering problems
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 18:3 (2012),  247–260
24. Computational complexity of recognition learning procedures in the class of piecewise-linear committee decision rules
    
    Avtomat. i Telemekh., 2010, no. 3,  178–189
25. Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 16:3 (2010),  276–284
26. Sigma-compactness of metric Boolean algebras and uniform convergence of frequencies to probabilities
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 16:1 (2010),  127–139
27. Combinatorial optimization problems related to the committee polyhedral separability of finite sets
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 14:2 (2008),  89–102
28. Parallel computations and committee constructions
    
    Avtomat. i Telemekh., 2007, no. 5,  182–192
29. Committees of systems of linear inequalities
    
    Avtomat. i Telemekh., 2004, no. 2,  43–54
30. Committee constructions as a generalization of contradictory problems of operations research
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 10:2 (2003),  56–66
31. Committee constructions for solving problems of selection, diagnostics, and prediction
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 8:1 (2002),  66–102
32. A game against nature associated with majority-vote decision making
    
    Zh. Vychisl. Mat. Mat. Fiz., 42:10 (2002),  1609–1616
33. On the existence of a majority committee
    
    Diskr. Mat., 9:3 (1997),  82–95
34. Estimate of the number of members in the minimal committee of a system of linear inequalities
    
    Zh. Vychisl. Mat. Mat. Fiz., 37:11 (1997),  1399–1404


35. Ivan Ivanovich Eremin
    
    Trudy Inst. Mat. i Mekh. UrO RAN, 20:2 (2014),  5–12
36. In memory of Ivan Ivanovich Eryomin (22.01.1933–21.07.2013)
    
    Zh. Vychisl. Mat. Mat. Fiz., 54:5 (2014),  887–891
37. Mathematical Programming: State of the Art
    
    Avtomat. i Telemekh., 2012, no. 2,  3–4