Pages that link to "Item:Q635755"
From MaRDI portal
The following pages link to Improved approximation for guarding simple galleries from the perimeter (Q635755):
Displaying 15 items.
- A new upper bound for the VC-dimension of visibility regions (Q390367) (← links)
- VC-dimension of perimeter visibility domains (Q402367) (← links)
- A non-linear lower bound for planar epsilon-nets (Q664354) (← links)
- The VC-dimension of visibility on the boundary of monotone polygons (Q1630914) (← links)
- A constant-factor approximation algorithm for vertex guarding a WV-polygon (Q2117689) (← links)
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (Q2340409) (← links)
- Approximability of guarding weak visibility polygons (Q2357167) (← links)
- Guarding monotone art galleries with sliding cameras in linear time (Q2363353) (← links)
- Near-linear approximation algorithms for geometric hitting sets (Q2429345) (← links)
- Constrained Light Deployment for Reducing Energy Consumption in Buildings (Q2958330) (← links)
- Universal Guard Problems (Q3177901) (← links)
- Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224) (← links)
- (Q5115778) (← links)
- On Partial Covering For Geometric Set Systems (Q5115815) (← links)
- The parameterized complexity of guarding almost convex polygons (Q6191439) (← links)
