Pages that link to "Item:Q5370733"
From MaRDI portal
The following pages link to Approximation algorithms for maximum independent set of pseudo-disks (Q5370733):
Displaying 16 items.
- Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve (Q364848) (← links)
- Exact algorithms and APX-hardness results for geometric packing and covering problems (Q390102) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Approximation algorithms for maximum independent set of a unit disk graph (Q483059) (← links)
- PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Improved results on geometric hitting set problems (Q603882) (← links)
- Balanced independent and dominating sets on colored interval graphs (Q831789) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- Robust online algorithms for dynamic choosing problems (Q2117763) (← links)
- Local search is a PTAS for feedback vertex set in minor-free graphs (Q2197532) (← links)
- Near-linear algorithms for geometric hitting sets and set covers (Q2291457) (← links)
- Coloring and Maximum Independent Set of Rectangles (Q3088088) (← links)
- Geometric Packing under Nonuniform Constraints (Q4593249) (← links)
- (Q5009574) (← links)
