Please use this identifier to cite or link to this item: http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/2837
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMudgal, A.-
dc.contributor.authorPandit, S.-
dc.date.accessioned2021-09-29T20:58:08Z-
dc.date.available2021-09-29T20:58:08Z-
dc.date.issued2021-09-30-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/2837-
dc.description.abstractWe initiate the study of a generalization of the class cover problem [1, 2], the generalized class cover problem, where we are allowed to misclassify some points provided we pay an associated positive penalty for every misclassified point. We study five different variants of generalized class cover problem with axis-parallel strips and half-strips in the plane, thus extending similar work by Bereg et al. [2] on the class cover problem. For each of these variants, we either show that they are in P, or prove that they are NP-complete and give constant factor approximation algorithmsen_US
dc.language.isoen_USen_US
dc.subjectclass cover problemen_US
dc.subjectaxis-parallel stripsen_US
dc.subjectapproximation algorithmsen_US
dc.subjectgeometric set cover.en_US
dc.titleGeneralized class cover problem with Axis-Parallel stripsen_US
dc.typeArticleen_US
Appears in Collections:Year-2014

Files in This Item:
File Description SizeFormat 
Full Text.pdf355.77 kBAdobe PDFView/Open    Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.