Browsing by Subject "High dimensional data"
Now showing items 1-1 of 1
-
(Elsevier, 2020)Given a set B of d-dimensional boxes (i.e., axis-aligned hyperrectangles), a minimum coverage kernel is a subset of B of minimum size covering the same region as B. Computing it is NP-hard, but as for many similar NP-hard ...