Packing and covering with non-piercing regions

Sathish Govindarajan, Rajiv Raman, Saurabh Ray, Aniket Basu Roy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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). We show that the local search algorithm that yields PTASs when the regions are disks [5, 19, 28] can be extended to work for non-piercing regions. While such an extension is intuitive and natural, attempts to settle this question have failed even for pseudodisks. The techniques used for analysis when the regions are disks rely heavily on the underlying geometry, and do not extend to topologically defined settings such as pseudodisks. In order to prove our results, we introduce novel techniques that we believe will find applications in other problems. 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. Our result settles a conjecture of Har-Peled (see Conclusion of [20]) 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, extending one of the results of Ene et al. [16].

Original languageEnglish (US)
Title of host publication24th Annual European Symposium on Algorithms, ESA 2016
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Volume57
ISBN (Electronic)9783959770156
DOIs
StatePublished - Aug 1 2016
Event24th Annual European Symposium on Algorithms, ESA 2016 - Aarhus, Denmark
Duration: Aug 22 2016Aug 24 2016

Other

Other24th Annual European Symposium on Algorithms, ESA 2016
CountryDenmark
CityAarhus
Period8/22/168/24/16

Fingerprint

Polynomials
Geometry

Keywords

  • Approximation algorithms
  • Capacitated packing
  • Dominating set
  • Local search
  • Set cover

ASJC Scopus subject areas

  • Software

Cite this

Govindarajan, S., Raman, R., Ray, S., & Roy, A. B. (2016). Packing and covering with non-piercing regions. In 24th Annual European Symposium on Algorithms, ESA 2016 (Vol. 57). [47] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2016.47

Packing and covering with non-piercing regions. / Govindarajan, Sathish; Raman, Rajiv; Ray, Saurabh; Roy, Aniket Basu.

24th Annual European Symposium on Algorithms, ESA 2016. Vol. 57 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. 47.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Govindarajan, S, Raman, R, Ray, S & Roy, AB 2016, Packing and covering with non-piercing regions. in 24th Annual European Symposium on Algorithms, ESA 2016. vol. 57, 47, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 24th Annual European Symposium on Algorithms, ESA 2016, Aarhus, Denmark, 8/22/16. https://doi.org/10.4230/LIPIcs.ESA.2016.47
Govindarajan S, Raman R, Ray S, Roy AB. Packing and covering with non-piercing regions. In 24th Annual European Symposium on Algorithms, ESA 2016. Vol. 57. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2016. 47 https://doi.org/10.4230/LIPIcs.ESA.2016.47
Govindarajan, Sathish ; Raman, Rajiv ; Ray, Saurabh ; Roy, Aniket Basu. / Packing and covering with non-piercing regions. 24th Annual European Symposium on Algorithms, ESA 2016. Vol. 57 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016.
@inproceedings{552a50c1fff44bf1a98fb82c156ba877,
title = "Packing and covering with non-piercing regions",
abstract = "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). We show that the local search algorithm that yields PTASs when the regions are disks [5, 19, 28] can be extended to work for non-piercing regions. While such an extension is intuitive and natural, attempts to settle this question have failed even for pseudodisks. The techniques used for analysis when the regions are disks rely heavily on the underlying geometry, and do not extend to topologically defined settings such as pseudodisks. In order to prove our results, we introduce novel techniques that we believe will find applications in other problems. 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. Our result settles a conjecture of Har-Peled (see Conclusion of [20]) 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, extending one of the results of Ene et al. [16].",
keywords = "Approximation algorithms, Capacitated packing, Dominating set, Local search, Set cover",
author = "Sathish Govindarajan and Rajiv Raman and Saurabh Ray and Roy, {Aniket Basu}",
year = "2016",
month = "8",
day = "1",
doi = "10.4230/LIPIcs.ESA.2016.47",
language = "English (US)",
volume = "57",
booktitle = "24th Annual European Symposium on Algorithms, ESA 2016",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

}

TY - GEN

T1 - Packing and covering with non-piercing regions

AU - Govindarajan, Sathish

AU - Raman, Rajiv

AU - Ray, Saurabh

AU - Roy, Aniket Basu

PY - 2016/8/1

Y1 - 2016/8/1

N2 - 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). We show that the local search algorithm that yields PTASs when the regions are disks [5, 19, 28] can be extended to work for non-piercing regions. While such an extension is intuitive and natural, attempts to settle this question have failed even for pseudodisks. The techniques used for analysis when the regions are disks rely heavily on the underlying geometry, and do not extend to topologically defined settings such as pseudodisks. In order to prove our results, we introduce novel techniques that we believe will find applications in other problems. 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. Our result settles a conjecture of Har-Peled (see Conclusion of [20]) 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, extending one of the results of Ene et al. [16].

AB - 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). We show that the local search algorithm that yields PTASs when the regions are disks [5, 19, 28] can be extended to work for non-piercing regions. While such an extension is intuitive and natural, attempts to settle this question have failed even for pseudodisks. The techniques used for analysis when the regions are disks rely heavily on the underlying geometry, and do not extend to topologically defined settings such as pseudodisks. In order to prove our results, we introduce novel techniques that we believe will find applications in other problems. 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. Our result settles a conjecture of Har-Peled (see Conclusion of [20]) 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, extending one of the results of Ene et al. [16].

KW - Approximation algorithms

KW - Capacitated packing

KW - Dominating set

KW - Local search

KW - Set cover

UR - http://www.scopus.com/inward/record.url?scp=85013013280&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85013013280&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.ESA.2016.47

DO - 10.4230/LIPIcs.ESA.2016.47

M3 - Conference contribution

AN - SCOPUS:85013013280

VL - 57

BT - 24th Annual European Symposium on Algorithms, ESA 2016

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -