Pages that link to "Item:Q2357167"

The following pages link to Approximability of guarding weak visibility polygons (Q2357167):

Displaying 21 items.

• Improved approximation for guarding simple galleries from the perimeter (Q635755) (← links)
• Approximation algorithms for art gallery problems in polygons (Q968202) (← 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)
• An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (Q2340409) (← links)
• Approximate guarding of monotone and rectilinear polygons (Q2375947) (← links)
• Maximizing the guarded boundary of an Art Gallery is APX-complete (Q2385696) (← links)
• Connecting guards with minimum Steiner points inside simple polygons (Q2419109) (← links)
• Finding minimum hidden guard sets in polygons --- tight approximability results (Q2489014) (← links)
• A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems (Q3603524) (← links)
• An approximation algorithm for the art gallery problem (Q4580094) (← links)
• Parameterized Hardness of Art Gallery Problems (Q4606288) (← 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)
• Cooperative guards in art galleries (Q5440225) (← links)
• Optimal Guard Placement Problem Under L-Visibility (Q5505310) (← links)
• Automata, Languages and Programming (Q5716760) (← links)
• Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains (Q5918442) (← links)
• Inapproximability results for guarding polygons and terrains (Q5946124) (← links)
• The parameterized complexity of guarding almost convex polygons (Q6191439) (← links)