1. A. E. Baburin and E. Kh. Gimadi, “An Approximation Algorithm for Finding a d-Regular Spanning Connected Subgraph of Maximum Weight in a Complete Graph with Random Weights of Edges,” Diskret. Anal. Issled. Oper. Ser. 2, 13(2), 3–20 (2006) [J. Appl. Indust. Math. 2 (2), 155–166 (2008)].
2. E. Kh. Gimadi, N. I. Glebov, and V. A. Perepelitsa, “Algorithms with Estimates for Discrete Optimization Problems,” Problemy Kibernetiki 31, 35–42 (1976).
3. E. Kh. Gimadi and V. A. Perepelitsa, “Asymptotically Optimal Approach for Solving a Travelling Salesman Problem,” in Upravlyaemye Sistemy, Vol. 12 (Inst. Mat., Novosibirsk, 1974), pp. 35–45.
4. M. R. Garey and D. S. Johnson, Computers and Intractability (W. H. Freeman, San-Francisco, 1979; Mir, Moscow, 1982).
5. H. David, Order Statistics (Nauka, Moscow, 1979) [in Russian].