Abstract:
In the paper, the computational and approximational complexity of the minimal affine separating committee problem, as well as of some important special cases of this problem, is investigated.
Citation:
V. D. Mazurov, M. Yu. Khachai, M. I. Poberii, “Combinatorial optimization problems related to the committee polyhedral separability of finite sets”, Trudy Inst. Mat. i Mekh. UrO RAN, 14, no. 2, 2008, 89–102; Proc. Steklov Inst. Math. (Suppl.), 263, suppl. 2 (2008), S93–S107