Approximation Algorithms for Maximum Independent Set of Pseudo-Disks

Discrete & Computational Geometry, Mar 2012

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, which 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 case. As such, the analysis of both algorithms requires some new combinatorial ideas, which we believe to be of independent interest.

This is a preview of a remote PDF: https://link.springer.com/content/pdf/10.1007%2Fs00454-012-9417-5.pdf

Timothy M. Chan, Sariel Har-Peled. Approximation Algorithms for Maximum Independent Set of Pseudo-Disks, Discrete & Computational Geometry, 2012, 373-392, DOI: 10.1007/s00454-012-9417-5