Corpus ID: 230435887

# Approximating Maximum Independent Set for Rectangles in the Plane

@article{Mitchell2021ApproximatingMI,
title={Approximating Maximum Independent Set for Rectangles in the Plane},
author={Joseph S. B. Mitchell},
journal={ArXiv},
year={2021},
volume={abs/2101.00326}
}
We give a polynomial-time constant-factor approximation algorithm for maximum independent set for (axis-aligned) rectangles in the plane. Using a polynomial-time algorithm, the best approximation factor previously known is O(log log n). The results are based on a new form of recursive partitioning in the plane, in which faces that are constant-complexity and orthogonally convex are recursively partitioned in a constant number of such faces.

#### Figures from this paper

A (2+\epsilon)-Approximation Algorithm for Maximum Independent Set of Rectangles
This paper presents a (2 + ε)-approximation algorithm for MISR which is also based on a recursive partitioning scheme which allows for an arguably simpler analysis and improves the approximation ratio to 6. Expand
A 4-Approximation Algorithm for Maximum Independent Set of Rectangles
• Computer Science
• ArXiv
• 2021
This paper presents a 4-approximation algorithm for MISR which is based on a similar recursive partitioning scheme, however, it uses a more general class of polygons—polygons that are horizontally or vertically convex—which allows it to provide an arguably simpler analysis and improve the approximation ratio. Expand
A PTAS for the horizontal rectangle stabbing problem
• Arindam Khan
• Computer Science
• ArXiv
• 2021
A PTAS for Stabbing is obtained, settling the question whether the problem admits a PTAS and implies improved approximations for other problems such as generalized minimum Manhattan network. Expand
A QPTAS for stabbing rectangles
• Computer Science
• ArXiv
• 2021
This work presents a quasipolynomial time approximation scheme (QPTAS) for rectangle stabbing, and provides a simple 8-approximation algorithm that avoids the framework of Varadarajan. Expand
Worst-Case Efficient Dynamic Geometric Independent Set
• Computer Science
• ESA
• 2021
A data structure is presented that maintains a constant-factor approximate maximum independent set for broad classes of fat objects in d dimensions in sublinear worst-case update time, giving the first results for dynamic independent set in a wide variety of geometric settings. Expand

#### References

SHOWING 1-10 OF 29 REFERENCES
Approximating maximum independent set for rectangles in the plane
• arXiv preprint arXiv:2101.00326,
• 2021
A 4-Approximation Algorithm for Maximum Independent Set of Rectangles
• Computer Science
• ArXiv
• 2021
This paper presents a 4-approximation algorithm for MISR which is based on a similar recursive partitioning scheme, however, it uses a more general class of polygons—polygons that are horizontally or vertically convex—which allows it to provide an arguably simpler analysis and improve the approximation ratio. 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
Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
• Computer Science, Mathematics
• ESA
• 2019
A parameterized approximation scheme (PAS) for MISR and a PAS for TDKR, where the problems admit a QPTAS for polynomially bounded item sizes and it is shown that both variants are W[1]-hard. Expand
On Approximating Maximum Independent Set of Rectangles
• Mathematics, Computer Science
• 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
• 2016
An algorithm for MISR is provided that achieves a (1 - ε)-approximation in time nO(poly(log logn/ε)). Expand
An Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs
• Computer Science, Mathematics
• CCCG
• 2015
Given an outerstring graph and an intersection model consisting of polygonal arcs with a total of N segments, an algorithm is developed that solves the Maximum Weight Independent Set problem in O ( N 3 ) time. 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
Quasi-Polynomial Time Approximation Scheme for Sparse Subsets of Polygons
The algorithm works by extending the result of Adamaszek and Wiese to polygons of arbitrary complexity, and it is shown that one can approximate the largest subset of polygons, such that the intersection graph of the subset does not contain a cycle of length 4. Expand
Approximation Schemes for Maximum Weight Independent Set of Rectangles
• Computer Science, Mathematics
• 2013 IEEE 54th Annual Symposium on Foundations of Computer Science
• 2013
This work presents the first (1 + ε)-approximation algorithm for the MWISR problem with quasipolynomial running time 2poly(log n/ε) and presents a new geometric dynamic program which recursively subdivides the plane into polygons of bounded complexity. Expand
Coloring and Maximum Independent Set of Rectangles
A new bound for σ(q) is presented that significantly improves the known bounds for a broad class of instances of MISR and has a strong connection with the integrality gap of natural LP relaxation for MISR. Expand