Pages that link to "Item:Q968202"

The following pages link to Approximation algorithms for art gallery problems in polygons (Q968202):

Displaying 32 items.

• How to guard orthogonal polygons: diagonal graphs and vertex covers (Q262314) (← links)
• Polygon guarding with orientation (Q340539) (← links)
• Watchman tours for polygons with holes (Q419503) (← links)
• A nearly optimal algorithm for covering the interior of an art gallery (Q632590) (← links)
• Improved approximation for guarding simple galleries from the perimeter (Q635755) (← links)
• The art gallery theorem for polyominoes (Q715003) (← links)
• An efficient algorithm for guard placement in polygons with holes (Q1346129) (← links)
• Fast vertex guarding for polygons with and without holes (Q1931264) (← links)
• A constant-factor approximation algorithm for vertex guarding a WV-polygon (Q2117689) (← links)
• Reliable wireless multimedia sensor network design: comparison of hybrid metaheuristics and a matheuristic (Q2322749) (← 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)
• Maximizing the guarded boundary of an Art Gallery is APX-complete (Q2385696) (← links)
• A unified solving approach for two and three dimensional coverage problems in sensor networks (Q2629914) (← links)
• On orthogonally guarding orthogonal polygons with bounded treewidth (Q2659775) (← links)
• A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras (Q2946049) (← links)
• Constrained Light Deployment for Reducing Energy Consumption in Buildings (Q2958330) (← links)
• Universal Guard Problems (Q3177901) (← links)
• A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems (Q3603524) (← links)
• Art Gallery Problems for Convex Nested Polygons (Q4367047) (← links)
• (Q4437494) (← links)
• An approximation algorithm for the art gallery problem (Q4580094) (← links)
• (Q4694723) (← links)
• An exact algorithm for minimizing vertex guards on art galleries (Q4910663) (← 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)
• Algorithm 966 (Q5270778) (← 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)
• A practical algorithm with performance guarantees for the art gallery problem (Q6599806) (← links)