On approximating maximum independent set of rectangles
From MaRDI portal
Cited in
(5)- Approximation of MWIS on geometric intersection graphs
- Learning-augmented maximum independent set
- Improved approximation algorithms for 2-dimensional knapsack: packing into multiple l-shapes, spirals, and more
- Parameterized approximation for maximum weight independent set of rectangles and segments
- Dynamic streaming algorithms for geometric independent set
This page was built for publication: On approximating maximum independent set of rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946414)