We consider the NP-hard problem of polyhedral separability of two finite sets A and B of points in general position in ℝd by the minimum number of hyperplanes in the sense of a boolean function from a
We study the computational complexity of the vertex cover problem in the class of planar graphs (planar triangulations) admitting a plane representation whose faces are triangles. It is shown that...
1 January 2019 in Trudy Instituta Matematiki i Mekhaniki UrO RAN
Том 25, номер 1, 2019 УДК 519.856 MSC: 90C15 DOI: 10.21538/0134-4889-2019-25-1-62-77 Исследования поддержаны Российским научным фондом, грант № 14-11-00109.