Shenmaier Vladimir Vladimirovich

Publications in Math-Net.Ru

1. Approximability of the problem of finding a vector subset with the longest sum
   
   Diskretn. Anal. Issled. Oper., 25:4 (2018),  131–148
2. An algorithm for the polyhedral cycle cover problem with restrictions on the number and length of cycles
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 24:3 (2018),  272–280
3. Complexity and approximation of finding the longest vector sum
   
   Zh. Vychisl. Mat. Mat. Fiz., 58:6 (2018),  883–889
4. An exact algorithm for finding a vector subset with the longest sum
   
   Diskretn. Anal. Issled. Oper., 24:4 (2017),  111–129
5. Approximation scheme for the problem of weighted 2-partitioning with a fixed center of one cluster
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 23:3 (2017),  159–170
6. Solving some vector subset problems by Voronoi diagrams
   
   Diskretn. Anal. Issled. Oper., 23:4 (2016),  102–115
7. Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters
   
   Trudy Inst. Mat. i Mekh. UrO RAN, 21:3 (2015),  100–109
8. The smallest $k$-enclosing ball problem
   
   Diskretn. Anal. Issled. Oper., 20:1 (2013),  93–99
9. Approximation scheme for one problem of a vector subset choice
   
   Diskretn. Anal. Issled. Oper., 19:2 (2012),  92–100
10. An asymptotically exact algorithm for the maximum-weight traveling salesman problem in a finite-dimensional normed space
    
    Diskretn. Anal. Issled. Oper., 17:4 (2010),  84–91
11. An approximation algorithm for the hierarchical median problem
    
    Diskretn. Anal. Issled. Oper., 15:4 (2008),  84–91
12. Алгоритм приближённого решения одномерной задачи о последовательности медиан
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 14:2 (2007),  95–101
13. Analysis of coordinate-wise lifting algorithms for polymatroids
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 9:4 (2002),  75–81
14. Generalization of the concept of the rank function of a matroid
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000),  111–125
15. On the applicability of a coordinate-wise ascent algorithm to integer programming problems
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000),  38–47
16. Maximization of a linear objective function by a greedy algorithm
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 6:4 (1999),  104–120