| References |
Mazurov, Vl.D., Khachai, M.Yu., Rybin, A.I., Committee constructions for solving problems of selection, diagnostics and prediction (2002) Proc. Steklov Inst. Math., 1, pp. 67-101; Feige, U., A threshold of ln n for approximating set cover (1998) J. ACM, 45, pp. 634-652. , 4; Arrow, K.J., (1963) Social Choice and Individual Values, , 2 Wiley New York; Saari, D.G., (1995) Basic Geometry of Voting., , Springer Berlin Heidelberg New York; Black, D., (1998) The Theory of Committees and Elections, , 2 Kluwer New York; Vapnik, V.N., (1998) Statistical Learning Theory, , Wiley New York; Hastie, T., Tibshirani, R., Friedman, J., (2001) Elements of Statistical Learning, , Springer Berlin Heidelberg New York; Eremin, I.I., (2002) Theory of Linear Optimization, , BVM, Offenbach; Eremin, I.I., Mazurov, Vl.D., (1979) Nonstable Processes of Mathematical Programming, , Nauka, Moscow; Lund, C., Yannakakis, M., On the hardness of approximating minimization problems (1992) Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, pp. 960-981. , IEEE Computer Society, New York; Johnson, D.S., Preparata, F.P., The densest hemisphere problem (1978) Theor. Comp. Sci., 6, pp. 93-107; Garey, M.R., Johnson, D.S., (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, , Freeman San Francisco, CA; Khachay, M.Yu., On approximate algorithm of a minimum committee of a linear inequalities system (2003) Pattern Recognit. Image Anal., 13, pp. 459-464. , 3; Gale, D., Kuhn, H.W., Tucker, A.W., Neighboring vertices on a convex polyhedron (1956) Linear Inequalities and Related Systems, pp. 255-263. , Princeton University Press Princeton, NJ |