A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
From MaRDI portal
Recommendations
- An approximation algorithm for the art gallery problem
- Approximation algorithms for art gallery problems in polygons
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries
- Approximability of guarding weak visibility polygons
- Improved approximation for guarding simple galleries from the perimeter
Cited in
(18)- The VC-dimension of visibility on the boundary of monotone polygons
- A constant-factor approximation algorithm for vertex guarding a WV-polygon
- Line segment visibility with sidedness constraints
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries
- Approximability of guarding weak visibility polygons
- Approximate guarding of monotone and rectilinear polygons
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear
- An approximation algorithm for the art gallery problem
- A Novel Efficient Approach for Solving the Art Gallery Problem
- How to Keep an Eye on Small Things
- Parameterized Analysis of Art Gallery and Terrain Guarding
- scientific article; zbMATH DE number 7236415 (Why is no real title available?)
- The parameterized complexity of guarding almost convex polygons
- A nearly optimal algorithm for covering the interior of an art gallery
- Improved approximation for guarding simple galleries from the perimeter
- Robustly guarding polygons
- Polynomial-time algorithms for contiguous art gallery and related problems
- Approximation algorithms for art gallery problems in polygons
This page was built for publication: A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603524)
