Show simple item record

Authordc.contributor.authorBarbay, Jérémy 
Authordc.contributor.authorPérez-Lantero, Pablo 
Authordc.contributor.authorRojas-Ledesma, Javiel 
Admission datedc.date.accessioned2019-05-31T15:19:54Z
Available datedc.date.available2019-05-31T15:19:54Z
Publication datedc.date.issued2018
Cita de ítemdc.identifier.citationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Volumen 10976 LNCS, 2018, Pages 180-191
Identifierdc.identifier.issn16113349
Identifierdc.identifier.issn03029743
Identifierdc.identifier.other10.1007/978-3-319-94776-1_16
Identifierdc.identifier.urihttps://repositorio.uchile.cl/handle/2250/169393
Abstractdc.description.abstractWe 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.
Lenguagedc.language.isoen
Publisherdc.publisherSpringer Verlag
Type of licensedc.rightsAttribution-NonCommercial-NoDerivs 3.0 Chile
Link to Licensedc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/cl/
Sourcedc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Keywordsdc.subjectTheoretical Computer Science
Keywordsdc.subjectComputer Science (all)
Títulodc.titleComputing coverage kernels under restricted settings
Document typedc.typeArtículo de revista
Catalogueruchile.catalogadorjmm
Indexationuchile.indexArtículo de publicación SCOPUS
uchile.cosechauchile.cosechaSI


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Chile
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivs 3.0 Chile