1. DSpace at
  2. Research Publications
  3. Year-2019
Please use this identifier to cite or link to this item: http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/999
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMadireddy, R.R.-
dc.contributor.authorMudgal, A.-
dc.date.accessioned2018-11-12T08:50:08Z-
dc.date.available2018-11-12T08:50:08Z-
dc.date.issued2018-11-12-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/999-
dc.description.abstractWe prove that both set cover and hitting set problems with points and axis-parallel rectangles are -hard even when (i) all rectangles share a common point and there are only two types of rectangles and for some positive integers a and b.en_US
dc.language.isoen_USen_US
dc.subjectAxis-parallel rectanglesen_US
dc.subjectGeometric set coveren_US
dc.subjectGeometric hitting seten_US
dc.subjectNP,-hardnessen_US
dc.subjectComputational geometryen_US
dc.titleNP-hardness of geometric set cover and hitting set with rectangles containing a common pointen_US
dc.typeArticleen_US
Appears in Collections:Year-2019

Files in This Item:
File Description SizeFormat 
Full Text.pdf1.07 MBAdobe PDFView/Open    Request a copy
Show simple item record


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