References |
Garey, M., Johnson, D., (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, Ed. by W. H. Freeman, , Freeman, San Francisco; Papadimitriou, C., (1977) Theor. Comput. Sci., 4 (3), pp. 237-244; Christofides, N., (1976) Graduate School of Industrial Administration, , Carnegie Mellon Univ., Pittsburgh; Gimadi, E.K., (2008) Proc. Steklov Inst. Math., 263, pp. 57-67; Baburin, A.E., Della, C.F., Gimadi, E.K., Glazkov, Y.V., Paschos, V.T., (2009) Discrete Appl. Math., 157 (9), pp. 1988-1992; Baburin, A.E., Gimadi, E.K., (2011) Proc. Steklov Inst. Math., 272, pp. 1-13; Ageev, A.A., Pyatkin, A.V., (2009) Diskret. Anal. Issled. Operatsii, 16 (4), pp. 3-20; Gimadi, E.K., Glazkov, Y.V., Glebov, A.N., (2009) J. Appl. Indust. Math., 3 (1), pp. 46-60; Arora, S., (1998) J. ACM, 45 (5), pp. 753-782; Khachai, M.Y., Neznakhina, E.D., (2014) Tr. Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk, 20 (4), pp. 297-311; Sahni, S., Gonzales, T., (1976) J. ACM, 23 (3), pp. 555-565; Cormen, T., Leiserson, C., Rivest, R., Stein, C., (1990) Introduction to Algorithms, , MIT Press, Cambridge; Finkel, R., Bentley, J., (1974) Acta Inform., 4 (1), 9p |