A constant-factor approximation algorithm for red-blue Set cover with unit disks

dc.contributor.author	Madireddy, R.R.
dc.contributor.author	Mudgal, A.
dc.date.accessioned	2022-09-03T09:29:18Z
dc.date.available	2022-09-03T09:29:18Z
dc.date.issued	2022-09-03
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/3946
dc.description.abstract	The main contribution of this paper is the first constant factor approximation algorithm for red-blue set cover problem with unit disks. To achieve this, we first give a polynomial time algorithm for line-separable red-blue set cover problem with unit disks. We next obtain a factor 2 approximation algorithm for strip-separable red-blue set cover problem with unit disks. Finally, we obtain a constant factor approximation algorithm for red-blue set cover problem with unit disks by combining our algorithm for the strip-separable problem with the results of Ambühl et al. Our methods involve a novel decomposition of the optimal solution to line-separable problem into blocks with special structure and extensions of the sweep-line technique of Erlebach and van Leeuwen.	en_US
dc.language.iso	en_US	en_US
dc.subject	Line-separable	en_US
dc.subject	Red-blue set cover	en_US
dc.subject	Strip-separable	en_US
dc.subject	Sweep-line method	en_US
dc.subject	Unit disks	en_US
dc.title	A constant-factor approximation algorithm for red-blue Set cover with unit disks	en_US
dc.type	Article	en_US