Pages that link to "Item:Q5384010"
From MaRDI portal
The following pages link to A QPTAS for Maximum Weight Independent Set of Polygons with Polylogarithmically Many Vertices (Q5384010):
Displaying 15 items.
- A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728) (← links)
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking (Q1742371) (← links)
- Anchored rectangle and square packings (Q1751252) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q1987245) (← links)
- Packing and covering with non-piercing regions (Q1991095) (← links)
- A note on a QPTAS for maximum weight triangulation of planar point sets (Q2448113) (← links)
- A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set (Q3448837) (← links)
- Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces (Q3451756) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
- Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs (Q5009632) (← links)
- Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking (Q5111257) (← links)
- Optimality program in segment and string graphs (Q5920196) (← links)
- On the geometric priority set cover problem (Q6103173) (← links)
- Geometric dominating-set and set-cover via local-search (Q6114477) (← links)
- Geometric stabbing via threshold rounding and factor revealing LPs (Q6124825) (← links)
