Tight bounds for the rectangular art gallery problem
From MaRDI portal
Recommendations
- On the rectilinear art gallery problem
- Exact solutions and bounds for general art gallery problems
- Exact Solutions and Bounds for General Art Gallery Problems
- On the rectilinear art gallery problem. Algorithmic aspects
- Approximation algorithms for art gallery problems in polygons
- An approximation algorithm for the art gallery problem
- Maximizing the guarded boundary of an Art Gallery is APX-complete
- Maximizing the guarded boundary of an art gallery is APX-complete
- Approximation Algorithms for Art Gallery Problems in Polygons and Terrains
- A nearly optimal algorithm for covering the interior of an art gallery
Cited in
(9)- Guarding rectangular art galleries
- Mobile versus point guards
- A Short Proof of the Rectilinear Art Gallery Theorem
- Art Gallery Problems for Convex Nested Polygons
- Maximizing the guarded boundary of an art gallery is APX-complete
- A simple proof of the rectilinear art gallery theorem
- Exact Solutions and Bounds for General Art Gallery Problems
- The smallest art gallery not guarded by every third vertex
- A nearly optimal algorithm for covering the interior of an art gallery
This page was built for publication: Tight bounds for the rectangular art gallery problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4694723)