Generalized class cover problem with Axis-Parallel strips

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 Field	Value	Language
dc.contributor.author	Mudgal, A.	-
dc.contributor.author	Pandit, S.	-
dc.date.accessioned	2021-09-29T20:58:08Z	-
dc.date.available	2021-09-29T20:58:08Z	-
dc.date.issued	2021-09-30	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/2837	-
dc.description.abstract	We 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 algorithms	en_US
dc.language.iso	en_US	en_US
dc.subject	class cover problem	en_US
dc.subject	axis-parallel strips	en_US
dc.subject	approximation algorithms	en_US
dc.subject	geometric set cover.	en_US
dc.title	Generalized class cover problem with Axis-Parallel strips	en_US
dc.type	Article	en_US
Appears in Collections:	Year-2014

Files in This Item:

File	Description	Size	Format
Full Text.pdf		355.77 kB	Adobe PDF	View/Open Request a copy

DSpace JSPUI