NP-hardness of geometric set cover and hitting set with rectangles containing a common point

dc.contributor.author	Madireddy, R.R.
dc.contributor.author	Mudgal, A.
dc.date.accessioned	2018-11-12T08:50:08Z
dc.date.available	2018-11-12T08:50:08Z
dc.date.issued	2018-11-12
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/999
dc.description.abstract	We 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.iso	en_US	en_US
dc.subject	Axis-parallel rectangles	en_US
dc.subject	Geometric set cover	en_US
dc.subject	Geometric hitting set	en_US
dc.subject	NP,-hardness	en_US
dc.subject	Computational geometry	en_US
dc.title	NP-hardness of geometric set cover and hitting set with rectangles containing a common point	en_US
dc.type	Article	en_US