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
150 Citations
Efficient independent set approximation in unit disk graphs
  • 1
  • PDF
Geometric packing under non-uniform constraints
  • 20
  • PDF
Approximation Schemes for Covering and Packing
  • 27
  • Highly Influenced
  • PDF
Weighted geometric set cover via quasi-uniform sampling
  • 93
  • PDF
Improved Results on Geometric Hitting Set Problems
  • 190
  • Highly Influenced
  • PDF
Approximation Schemes for Independent Set and Sparse Subsets of Polygons
  • 10
  • PDF
PTAS for geometric hitting set problems via local search
  • 90
  • Highly Influenced
  • PDF
Approximation Schemes for Maximum Weight Independent Set of Rectangles
  • A. Adamaszek, A. Wiese
  • 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
  • 12
  • Highly Influenced
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-6 OF 6 REFERENCES
Weighted geometric set cover via quasi-uniform sampling
  • 93
  • Highly Influential
  • PDF
Maximum independent set of rectangles
  • 96
  • Highly Influential
  • PDF
Submodular function maximization via the multilinear relaxation and contention resolution schemes
  • 168
  • Highly Influential
  • PDF
New existence proofs ε-nets
  • 71
  • Highly Influential
Geometric separator theorems and applications
  • W. Smith, N. Wormald
  • 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