Pages that link to "Item:Q4580094"

The following pages link to An approximation algorithm for the art gallery problem (Q4580094):

Displaying 25 items.

• 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)
• Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
• A constant-factor approximation algorithm for vertex guarding a WV-polygon (Q2117689) (← links)
• Line segment visibility with sidedness constraints (Q2144449) (← links)
• Reachable region query and its applications (Q2201650) (← links)
• An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (Q2340409) (← links)
• Connecting guards with minimum Steiner points inside simple polygons (Q2419109) (← links)
• The Approximability of the Binary Paintshop Problem (Q2851858) (← links)
• A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems (Q3603524) (← links)
• (Q4437494) (← links)
• (Q4452106) (← links)
• Parameterized Hardness of Art Gallery Problems (Q4606288) (← links)
• (Q4694723) (← links)
• A Novel Efficient Approach for Solving the Art Gallery Problem (Q4915874) (← links)
• How to Keep an Eye on Small Things (Q5012868) (← links)
• Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224) (← links)
• (Q5115778) (← links)
• Exact Solutions and Bounds for General Art Gallery Problems (Q5233590) (← links)
• Parameterized complexity of geometric covering problems having conflicts (Q5919304) (← links)
• Minimizing visible edges in polyhedra (Q6083182) (← links)
• The parameterized complexity of guarding almost convex polygons (Q6191439) (← links)
• Topological art in simple galleries (Q6204773) (← 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)