# Approximation Algorithms for Maximum Independent Set of Pseudo-Disks

@article{Chan2012ApproximationAF,
title={Approximation Algorithms for Maximum Independent Set of Pseudo-Disks},
author={Timothy M. Chan and Sariel Har-Peled},
journal={Discrete \& Computational Geometry},
year={2012},
volume={48},
pages={373-392}
}
• Published 2012
• Mathematics, Computer Science
• Discrete & Computational Geometry
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… Expand

#### Topics from this paper

Geometric packing under non-uniform constraints
• Computer Science, Mathematics
• SoCG '12
• 2012
A general framework and an algorithm for approximating the optimal solution for packing in hypergraphs arising out of such geometric settings and a flotilla of results on this problem are provided. Expand
Geometric Packing under Nonuniform Constraints
• Mathematics, Computer Science
• SIAM J. Comput.
• 2017
A general framework and an algorithm for approximating the optimal solution for packing in hypergraphs arising out of such geometric settings and a flotilla of results on this problem are provided. Expand
Approximation Schemes for Independent Set and Sparse Subsets of Polygons
• Computer Science, Mathematics
• J. ACM
• 2019
Surprisingly, the (1+ε)-approximation algorithm can be extended to the problem of computing the maximum cardinality subset of the given set of polygons whose intersection graph fulfills some sparsity condition, and it is shown that one can approximate the maximum subset of polygon such that the intersection graph of the subset is planar or does not contain a cycle of length 4. Expand
A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices
• Computer Science, Mathematics
• SODA
• 2014
A (1 + e)-approximation algorithm, assuming that each polygon in the input has at most a polylogarithmic number of vertices, which implies that for this setting the problem is not APX-hard, unless NP ⊆ DTIME(2poly(log n)). Expand
Packing and Covering with Non-Piercing Regions
• Mathematics, Computer Science
• Discret. Comput. Geom.
• 2018
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) are designed. Expand
Coloring and Maximum Weight Independent Set of Rectangles
• Computer Science, Mathematics
• SODA
• 2021
The first asymptotic improvement over this six-decade-old bound is presented, proving that every intersection graph of axis-parallel rectangles in the plane admits an $O(\omega^2)$-coloring and presenting a polynomial-time algorithm that finds such a coloring. Expand
Threshold Rounding for the Standard LP Relaxation of some Geometric Stabbing Problems
• Computer Science
• ArXiv
• 2021
The rounding technique is based on a generalization of the threshold rounding idea used by Kovaleva and Spieksma, which may prove useful for rounding the LP relaxations of other geometric covering problems. Expand
Submodular function maximization via the multilinear relaxation and contention resolution schemes
• Computer Science, Mathematics
• STOC '11
• 2011
A broadly applicable framework for maximizing linear and submodular functions subject to independence constraints is developed and it is shown that contention resolution schemes are an effective way to round a fractional solution, even when f is non-monotone. Expand
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
It is shown that the disjoint union of two odd cycles is never the complement of a disk graph nor of a unit (3-dimensional) ball graph, and there is a constant ratio of approximation that cannot be attained even in time 2n1−ɛ, unless the Exponential Time Hypothesis fails. Expand
Improved Algorithm for Maximum Independent Set on Unit Disk Graph
• Computer Science, Mathematics
• CALDAM
• 2016
A 2-factor approximation algorithm for the maximum independent set problem on a unit disk graph, where the geometric representation of the graph has been given, using dynamic programming and farthest point Voronoi diagram concept to achieve the desired approximation factor. Expand

#### References

SHOWING 1-10 OF 40 REFERENCES
Weighted geometric set cover via quasi-uniform sampling
This article employs the idea of quasi-uniform sampling to obtain improved approximation guarantees in the weighted setting for a large class of problems for which such guarantees were known in the unweighted case. Expand
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
• Mathematics, Computer Science
• WG
• 2004
A polynomial-time approximation scheme for the maximum weight independent set problem in unit disk graphs is presented and is robust in the sense that it accepts any graph as input and either returns a (1+e)-approximate independent set or a certificate showing that the input graph is no unit disk graph. Expand
PTAS for geometric hitting set problems via local search
• Computer Science, Mathematics
• SCG '09
• 2009
This work gives the first PTAS for this problem when the geometric objects are half-spaces in Re3 and when they are an r-admissible set regions in the plane (this includes pseudo-disks as they are 2- admissible). Expand
Almost optimal set covers in finite VC-dimension
• Mathematics, Computer Science
• Discret. Comput. Geom.
• 1995
We give a deterministic polynomial-time method for finding a set cover in a set system (X, ℛ) of dual VC-dimensiond such that the size of our cover is at most a factor ofO(d log(dc)) from the optimalExpand
Hitting sets when the VC-dimension is small
• Mathematics, Computer Science
• Inf. Process. Lett.
• 2005
We present an approximation algorithm for the hitting set problem when the VC-dimension of the set system is small. Our algorithm uses a linear programming relaxation to compute a probability measureExpand
Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming
Approximation guarantees for randomized algorithms for packing and covering integer programs expressed in certain normal forms are proved and applications are described to a generalization of Dominating Set motivated by distributed file sharing applications, to an optimization problem motivated by an analysis of boosting, and to ageneralization of matching in hypergraphs. Expand
Simple heuristics for unit disk graphs
• Mathematics, Computer Science
• Networks
• 1995
This work presents simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs, including maximum independent set, minimum vertex cover, minimum coloring and minimum dominating set. Expand
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
• Mathematics, Computer Science
• SIAM J. Comput.
• 2005
These are the first known PTASs for $\mathcal{NP}$-hard optimization problems on disk graphs based on a novel recursive subdivision of the plane that allows applying a shifting strategy on different levels simultaneously, so that a dynamic programming approach becomes feasible. Expand
Label placement by maximum independent set in rectangles
• Computer Science, Mathematics
• CCCG
• 1997
This work investigates the problem of computing a large non-intersecting subset in a set of n rectangles in the plane and obtains a (1 + l/k)-approximati on in time O(n logn + n 2k-1) time, for any integer k/> 1. Expand
A note on maximum independent sets in rectangle intersection graphs
This work re-examines two known approximation results for finding the maximum independent set in the intersection graph of n axis-parallel rectangles and describes a similar algorithm running in only O(nlogn+nΔk−1) time, where Δ⩽n denotes the maximum number of rectangles a point can be in. Expand