ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Packing and Covering with Non-Piercing Regions

Roy, Aniket Basu and Govindarajan, Sathish and Raman, Rajiv and Ray, Saurabh (2018) Packing and Covering with Non-Piercing Regions. In: DISCRETE & COMPUTATIONAL GEOMETRY, 60 (2). pp. 471-492.

[img] PDF
Dis_Com_Geo_60-2_471_2018.pdf - Published Version
Restricted to Registered users only

Download (760kB) | Request a copy
Official URL: http://dx.doi.org/10.1007/s00454-018-9983-2


In this paper, we design the first polynomial time approximation schemes for the Set Cover and Dominating Set problems when the underlying sets are non-piercing regions (which include pseudodisks). Earlier, PTASs were known only in the setting where the regions were disks. These techniques relied heavily on the circularity of the disks. We develop new techniques to show that a simple local search algorithm yields a PTAS for the problems on non-piercing regions. We then consider the Capacitated Region Packing problem. Here, the input consists of a set of points with capacities, and a set of regions. The objective is to pick a maximum cardinality subset of regions so that no point is covered by more regions than its capacity. We show that this problem admits a PTAS when the regions are k-admissible regions (pseudodisks are 2-admissible), and the capacities are bounded by some constant. Our result settles a conjecture of Har-Peled from 2014 in the affirmative. The conjecture was for a weaker version of the problem, namely when the regions are pseudodisks, the capacities are uniform, and the point set consists of all points in the plane. Finally, we consider the Capacitated Point Packing problem. In this setting, the regions have capacities, and our objective is to find a maximum cardinality subset of points such that no region has more points than its capacity. We show that this problem admits a PTAS when the capacity is unity. This extends a result of Ene et al. from 2012.

Item Type: Journal Article
Publisher: SPRINGER, 233 SPRING ST, NEW YORK, NY 10013 USA
Additional Information: Copy right for this article belong to SPRINGER, 233 SPRING ST, NEW YORK, NY 10013 USA
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 06 Sep 2018 15:43
Last Modified: 06 Sep 2018 15:43
URI: http://eprints.iisc.ac.in/id/eprint/60579

Actions (login required)

View Item View Item