Complexity and approximability of committee polyhedral separability of sets in general position

Informatica

Volumn 20, Issue 2, 2009, Pages 217-234

  Khachay, Michael ^a   Poberii, Maria ^a  

^a INSTITUTE OF MATHEMATICS AND MECHANICS   (Russian Federation)

Author keywords

Approximation algorithms; Committees; Computational complexity; Polyhedral separability

Indexed keywords

EID: 67651238860     PISSN: 08684952     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (11)

1. Blum, A.L., and R.L. Rivest (1992). Training a 3-node neural network is NP-complete. Neural Networks, 5, 117-127.
2. Eremin, I.I., and Astafiev N.N. (1975). Introduction into the Theory of Linear and Convex Programming. Phys. Mat. Lit., Moscow, 192 pp. (in Russian).
3. Johnson, D.S. (1974). Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9(3), 256-278.
4. Khachai, M.Yu. (2006a). On the computational complexity of minimum committee problem and related problems. Doklady Mathematics, 73(1), 138-141.
5. Khachay, M.Yu. (2006b). On the computational and approximational complexity of the minimum affine separating committee problem. Tavricheskii Vestnik Informatiki i Matematiki, 1 34-43 (in Russian).
6. Khachai, M.Yu. (2008). Computational and approximational complexity of combinatorial problems related to the committee polyhedral separability of finite sets. Pattern Recognition and Image Analysis, 18(2), 237-242.
7. Khachai, M.Yu., and M.I. Pobery (2008). Computational complexity and approximability of combinatorial optimization problems connected with committee poplyhedral separability of finite sets. In 20th Intern. Conf. EURO Mini Conf. "Continuous Optimiz. & Knowledge-Based Technolog. (EurOPT-2008)". Selected papers. Technika, Vilnius. pp. 42-47.
8. Lin, J.H., and J.S. Vitter (1991). Complexity results on learning by neural nets. Machine Learning, 6, 211-230.
9. Mazurov, Vl.D. (1971). Committees of inequalities systems and the pattern recognition problem. Kibernetika, 3, 140-146 (in Russian).
10. Megiddo, N., and A. Tamir (1982). On the complexity of locating linear facilities in the plane. Operations Research Letters, 5(1), 194-197.
11. Megiddo, N. (1988). On the complexity of polyhedral separability. Discrete and Computational Geometry, 3, 325-337.