Work

Approximating Maximum Independent Set for Rectangles in the Plane

Year: 2021

Type: preprint

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 $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 into a constant number of such faces.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2101.00326

Author: Mitchell, Joseph S. B.

Institution: Stony Brook University

Language: English

Topic: Computational Geometry and Mesh Generation

Subfield: Computer Graphics and Computer-Aided Design

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Defense Advanced Research Projects Agency, Sandia National Laboratories

Award: AF:Small:Geometric Optimization Problems for Routing, Searching, and Coverage in the Face of Uncertainty

OpenAlex ID: W4287424652

Cites:

Cited by:

Related to: 10