Approximating Maximum Independent Set for Rectangles in the Plane
Computational Geometry
2021-07-07 v3 Data Structures and Algorithms
Abstract
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 . 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 into a constant number of such faces.
Cite
@article{arxiv.2101.00326,
title = {Approximating Maximum Independent Set for Rectangles in the Plane},
author = {Joseph S. B. Mitchell},
journal= {arXiv preprint arXiv:2101.00326},
year = {2021}
}