On the computational complexity of the minimum committee problem

DOI10.1007/S10852-006-9056-ZMaRDI QIDQ928677zbMATH OpenOpenAlexFDO

Authors M. Yu. Khachaĭ

Publication date 11 June 2008

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10852-006-9056-z

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational learning theory (68Q32) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 5158920
• Committees of systems of linear inequalities
• scientific article; zbMATH DE number 5181446
• scientific article; zbMATH DE number 5598224
• On the calculation and approximation complexity of the minimal affine separating committee problem

Cites work

• A threshold of ln n for approximating set cover
• Basic Geometry of Voting
• scientific article; zbMATH DE number 3121295 (Why is no real title available?)
• scientific article; zbMATH DE number 3737394 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 5181446 (Why is no real title available?)
• On the hardness of approximating minimization problems
• Social choice and individual values
• The densest hemisphere problem
• The elements of statistical learning. Data mining, inference, and prediction

Cited in

(6)

• Constraint elimination method for the committee problem
• scientific article; zbMATH DE number 5158920
• On the calculation and approximation complexity of the minimal affine separating committee problem
• scientific article; zbMATH DE number 1043902 (Why is no real title available?)
• Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning
• Committee polyhedral separability: complexity and polynomial approximation

This page was built for publication: On the computational complexity of the minimum committee problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q928677)