Pages that link to "Item:Q4606318"
From MaRDI portal
The following pages link to Packing and Covering with Non-Piercing Regions (Q4606318):
Displaying 16 items.
- Limits of local search: quality and efficiency (Q527441) (← links)
- On pseudo-disk hypergraphs (Q827317) (← links)
- A tight analysis of geometric local search (Q2117344) (← links)
- On dominating set of some subclasses of string graphs (Q2144448) (← links)
- Existence of planar support for geometric hypergraphs using elementary techniques (Q2174599) (← links)
- Capacitated covering problems in geometric spaces (Q2189730) (← links)
- Approximating dominating set on intersection graphs of rectangles and \(\mathsf{L}\)-frames (Q2331213) (← links)
- Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs (Q4593248) (← links)
- Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames (Q5005138) (← links)
- (Q5009574) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- (Q5111691) (← links)
- Capacitated Covering Problems in Geometric Spaces (Q5115774) (← links)
- On Partial Covering For Geometric Set Systems (Q5115815) (← links)
- (Q5115816) (← links)
- Local search strikes again: PTAS for variants of geometric covering and packing (Q5919362) (← links)
