# Approximation algorithms for maximum independent set of pseudo-disks

@inproceedings{Chan2009ApproximationAF, title={Approximation algorithms for maximum independent set of pseudo-disks}, author={Timothy M. Chan and Sariel Har-Peled}, booktitle={SCG '09}, year={2009} }

We present approximation algorithms for maximum independent set of pseudo-disks in the plane, both in the weighted and unweighted cases. For the unweighted case, we prove that a local search algorithm yields a PTAS. For the weighted case, we suggest a novel rounding scheme based on an LP relaxation of the problem, that leads to a constant-factor approximation. Most previous algorithms for maximum independent set (in geometric settings) relied on packing arguments that are not applicable in this… Expand

#### Figures and Topics from this paper

#### 150 Citations

Efficient independent set approximation in unit disk graphs

- Computer Science, Mathematics
- Discret. Appl. Math.
- 2020

1- PDF

Approximation Schemes for Covering and Packing

- Computer Science, Mathematics
- WALCOM
- 2013

27 Highly Influenced- PDF

Weighted geometric set cover via quasi-uniform sampling

- Mathematics, Computer Science
- STOC '10
- 2010

93- PDF

Improved Results on Geometric Hitting Set Problems

- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2010

190 Highly Influenced- PDF

Approximation Schemes for Independent Set and Sparse Subsets of Polygons

- Computer Science, Mathematics
- J. ACM
- 2019

10- PDF

PTAS for geometric hitting set problems via local search

- Mathematics, Computer Science
- SCG '09
- 2009

90 Highly Influenced- PDF

A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices

- Computer Science, Mathematics
- SODA
- 2014

37- PDF

Approximation Schemes for Maximum Weight Independent Set of Rectangles

- Mathematics, Computer Science
- 2013 IEEE 54th Annual Symposium on Foundations of Computer Science
- 2013

80 Highly Influenced- PDF

Approximation Algorithms for Dominating Set in Disk Graphs

- Mathematics, Computer Science
- ArXiv
- 2010

12 Highly Influenced- PDF

#### References

SHOWING 1-6 OF 6 REFERENCES

Weighted geometric set cover via quasi-uniform sampling

- Mathematics, Computer Science
- STOC '10
- 2010

93 Highly Influential- PDF

Submodular function maximization via the multilinear relaxation and contention resolution schemes

- Computer Science, Mathematics
- STOC '11
- 2011

168 Highly Influential- PDF

Geometric separator theorems and applications

- Mathematics, Computer Science
- Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
- 1998

91 Highly Influential

Polynomial-time approximation schemes for packing and piercing fat

- objects. J. Algorithms,
- 2003