Browsing by Author "025c685d-8f87-497d-88a2-c2d5769279da"

Now showing items 1-2 of 2

    • Computing coverage kernels under restricted settings 
      Barbay, Jérémy; Pérez Lantero, Pablo; Rojas Ledesma, Javiel (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 ...
    • Maximum-Weight Planar Boxes in O(n 2 ) Time (and Better) 
      Barbay, Jérémy; Chan, Timothy M.; Navarro, Gonzalo; Pérez Lantero, Pablo (Elsevier, 2013)
      Given a set P of n points in R d , where each point p of P is associated with a weight w(p) (positive or negative), the Maximum-Weight Box problem consists in finding an axis-aligned box B maximizing P p∈B∩P w(p). We ...