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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Proceedings of the Steklov Institute of Mathematics
Paper Title
Journal
Date
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
