![](/img/cover-not-exists.png)
Computational and approximational complexity of combinatorial problems related to the committee polyhedral separability of finite sets
M. Yu. KhachaiVolume:
18
Language:
english
Pages:
7
DOI:
10.1134/s1054661808020089
Date:
June, 2008
File:
PDF, 172 KB
english, 2008