Pages that link to "Item:Q3586466"
From MaRDI portal
The following pages link to Algorithms for Dominating Set in Disk Graphs: Breaking the logn Barrier (Q3586466):
Displaying 29 items.
- Approximation algorithms for intersection graphs (Q476425) (← links)
- PTAS for minimum \(k\)-path vertex cover in ball graph (Q503602) (← links)
- Limits of local search: quality and efficiency (Q527441) (← links)
- On pseudo-disk hypergraphs (Q827317) (← links)
- PTAS for \(\mathcal{H}\)-free node deletion problems in disk graphs (Q1706122) (← links)
- Packing and covering with non-piercing regions (Q1991095) (← links)
- Dominating set of rectangles intersecting a straight line (Q2025079) (← links)
- A tight analysis of geometric local search (Q2117344) (← links)
- On dominating set of some subclasses of string graphs (Q2144448) (← links)
- Algorithms for covering multiple submodular constraints and applications (Q2165261) (← links)
- A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
- On the geometric set multicover problem (Q2167317) (← links)
- A game theoretic approach for minimal connected dominating set (Q2193269) (← links)
- Constructing planar support for non-piercing regions (Q2207613) (← links)
- Minimum vertex cover in ball graphs through local search (Q2250102) (← links)
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames (Q2331213) (← links)
- Simple PTAS's for families of graphs excluding a minor (Q2352263) (← links)
- Efficient sub-5 approximations for minimum dominating sets in unit disk graphs (Q2453164) (← links)
- A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
- Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames (Q5005138) (← links)
- (Q5009574) (← links)
- (Q5111691) (← links)
- (Q5115816) (← links)
- (Q5743501) (← links)
- Improved Approximation Algorithm for Set Multicover with Non-Piercing Regions. (Q5874550) (← links)
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains (Q5918442) (← 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)
