Browsing by Author "61e586f9-ac01-4a63-9eb2-5d7f423d9a72"

Now showing items 1-3 of 3

    • 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 ...
    • Computing coverage kernels under restricted settings 
      Barbay, Jérémy; Pérez-Lantero, Pablo; Rojas-Ledesma, Javiel (Springer Verlag, 2018)
      We consider the Minimum Coverage Kernel problem: given a set B of d-dimensional boxes, find a subset of B of minimum size covering the same region as B. This problem is NP -hard, but as for many NP -hard problems on graphs, ...
    • Predecessor Search 
      Navarro, Gonzalo; Rojas-Ledesma, Javiel (Assoc Computing Machinery, USA, 2020)
      The predecessor problem is a key component of the fundamental sorting-and-searching core of algorithmic problems. While binary search is the optimal solution in the comparison model, more realistic machine models on integer ...