A 3-approximation algorithm for maximum independent set of rectangles
From MaRDI portal
Cited in
(17)- Stabbing boxes with finitely many axis-parallel lines and flats
- Approximation of MWIS on geometric intersection graphs
- Approximation schemes for geometric knapsack for packing spheres and fat objects
- Set cover, hitting set, and independent set problems for some restricted classes of geometric objects
- A 1.9999-approximation algorithm for vertex cover on string graphs
- Approximating the maximum independent set of convex polygons with a bounded number of directions
- Fully dynamic maximum independent sets of disks in polylogarithmic update time
- Learning-augmented maximum independent set
- Tight approximation algorithms for 2D guillotine strip packing
- On some geometric optimization problems with segments
- Approximation algorithms for round-UFP and round-SAP
- Segment proximity graphs and nearest neighbor queries amid disjoint segments
- Parameterized approximation for maximum weight independent set of rectangles and segments
- Random-order online independent set of intervals and hyperrectangles
- Fully dynamic maximum independent sets of disks in polylogarithmic update time
- Segment proximity graphs and nearest neighbor queries amid disjoint segments
- Dynamic streaming algorithms for geometric independent set
This page was built for publication: A 3-approximation algorithm for maximum independent set of rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575111)
