On the approximate complexity of the minimal committee problem

MaRDI QIDQ3440943zbMATH OpenFDO

Authors M. Yu. Khachaĭ

Publication date 29 May 2007

zbMATH Keywords

approximate complexityestimateminimal committee problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• On the computational complexity of the minimum committee problem
• On the calculation and approximation complexity of the minimal affine separating committee problem
• scientific article; zbMATH DE number 5598224
• Committees of systems of linear inequalities
• On the hardness of approximating minimization problems

Cited in

(3)

• 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?)
• On the computational complexity of the minimum committee problem

This page was built for publication: On the approximate complexity of the minimal committee problem

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