Computing coverage kernels under restricted settings
Author
dc.contributor.author
Barbay, Jérémy
Author
dc.contributor.author
Pérez-Lantero, Pablo
Author
dc.contributor.author
Rojas-Ledesma, Javiel
Admission date
dc.date.accessioned
2019-05-31T15:19:54Z
Available date
dc.date.available
2019-05-31T15:19:54Z
Publication date
dc.date.issued
2018
Cita de ítem
dc.identifier.citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Volumen 10976 LNCS, 2018, Pages 180-191
Identifier
dc.identifier.issn
16113349
Identifier
dc.identifier.issn
03029743
Identifier
dc.identifier.other
10.1007/978-3-319-94776-1_16
Identifier
dc.identifier.uri
https://repositorio.uchile.cl/handle/2250/169393
Abstract
dc.description.abstract
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, the problem becomes solvable in polynomial time under restrictions on the graph induced by B. We consider various classes of graphs, show that Minimum Coverage Kernel remains NP -hard even for severely restricted instances, and provide two polynomial time approximation algorithms for this problem.