dc.creator | Bereg, Sergey | es |
dc.creator | Cabello, S. | es |
dc.creator | Díaz Báñez, José Miguel | es |
dc.creator | Pérez Lantero, Pablo | es |
dc.creator | Seara Ojea, Carlos | es |
dc.creator | Ventura Molina, Inmaculada | es |
dc.date.accessioned | 2018-08-09T11:07:18Z | |
dc.date.available | 2018-08-09T11:07:18Z | |
dc.date.issued | 2012 | |
dc.identifier.citation | Bereg, S., Cabello, S., Díaz Báñez, J.M., Pérez Lantero, P., Seara, C. y Ventura Molina, I. (2012). The class cover problem with boxes. Computational Geometry:, 45 (7), 294-304. | |
dc.identifier.issn | 0925-7721 | es |
dc.identifier.uri | https://hdl.handle.net/11441/77965 | |
dc.description | Open archive-Elsevier | es |
dc.description.abstract | In this paper we study the following problem: Given sets R and B of r red and b
blue points respectively in the plane, find a minimum-cardinality set H of axis-aligned
rectangles (boxes) so that every point in B is covered by at least one rectangle of H, and
no rectangle of H contains a point of R. We prove the NP-hardness of the stated problem,
and give either exact or approximate algorithms depending on the type of rectangles
considered. If the covering boxes are vertical or horizontal strips we give an efficient
algorithm that runs in O(r log r + b log b +
√
rb) time. For covering with oriented halfstrips
an optimal O((r + b) log(min{r, b}))-time algorithm is shown. We prove that the
problem remains NP-hard if the covering boxes are half-strips oriented in any of the four
orientations, and show that there exists an O(1)-approximation algorithm. We also give an
NP-hardness proof if the covering boxes are squares. In this situation, we show that there
exists an O(1)-approximation algorithm. | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Elsevier | es |
dc.relation.ispartof | Computational Geometry:, 45 (7), 294-304. | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Class cover | es |
dc.subject | Classification | es |
dc.subject | Boxes | es |
dc.title | The class cover problem with boxes | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Matemática Aplicada II (ETSI) | es |
dc.relation.publisherversion | https://www.sciencedirect.com/science/article/pii/S0925772112000375 | es |
dc.identifier.doi | 10.1016/j.comgeo.2012.01.014 | es |
idus.format.extent | 11 p. | es |
dc.journaltitle | Computational Geometry: | es |
dc.publication.volumen | 45 | es |
dc.publication.issue | 7 | es |
dc.publication.initialPage | 294 | es |
dc.publication.endPage | 304 | es |