Pages that link to "Item:Q1931264"
From MaRDI portal
The following pages link to Fast vertex guarding for polygons with and without holes (Q1931264):
Displaying 12 items.
- Note on the paper ``K-vertex guarding simple polygons'' (Q924091) (← links)
- Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (Q2340409) (← links)
- Guarding monotone art galleries with sliding cameras in linear time (Q2363353) (← links)
- Finding minimum hidden guard sets in polygons --- tight approximability results (Q2489014) (← links)
- Constrained Light Deployment for Reducing Energy Consumption in Buildings (Q2958330) (← links)
- How to Keep an Eye on Small Things (Q5012868) (← links)
- Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224) (← links)
- Vertex Guarding for Dynamic Orthogonal Art Galleries (Q5072223) (← links)
- A constant-factor approximation algorithm for vertex guarding a WV-polygon (Q5075347) (← links)
- The parameterized complexity of guarding almost convex polygons (Q6191439) (← links)
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces (Q6556166) (← links)