Pages that link to "Item:Q3603524"
From MaRDI portal
The following pages link to A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems (Q3603524):
Displaying 16 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)
- 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)
- Line segment visibility with sidedness constraints (Q2144449) (← links)
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (Q2340409) (← links)
- Approximability of guarding weak visibility polygons (Q2357167) (← links)
- Approximate guarding of monotone and rectilinear polygons (Q2375947) (← links)
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear (Q3512447) (← links)
- An approximation algorithm for the art gallery problem (Q4580094) (← 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)
- The parameterized complexity of guarding almost convex polygons (Q6191439) (← links)