An approximation algorithm for the art gallery problem
From MaRDI portal
Recommendations
Cited in
(30)- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
- Improved approximation for guarding simple galleries from the perimeter
- scientific article; zbMATH DE number 2040955 (Why is no real title available?)
- A constant-factor approximation algorithm for vertex guarding a WV-polygon
- Approximation algorithms for art gallery problems in polygons
- scientific article; zbMATH DE number 2011842 (Why is no real title available?)
- A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
- A practical algorithm with performance guarantees for the art gallery problem
- Parameterized hardness of art gallery problems
- A practical algorithm with performance guarantees for the art gallery problem
- Line segment visibility with sidedness constraints
- How to Keep an Eye on Small Things
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries
- A Novel Efficient Approach for Solving the Art Gallery Problem
- scientific article; zbMATH DE number 219237 (Why is no real title available?)
- The parameterized complexity of guarding almost convex polygons
- Exact Solutions and Bounds for General Art Gallery Problems
- A nearly optimal algorithm for covering the interior of an art gallery
- Parameterized complexity of geometric covering problems having conflicts
- Topological art in simple galleries
- m-watchmen's routes in minbar and generalized minbar polygons
- Parameterized Analysis of Art Gallery and Terrain Guarding
- scientific article; zbMATH DE number 7236415 (Why is no real title available?)
- Robustly guarding polygons
- Minimizing visible edges in polyhedra
- Connecting guards with minimum Steiner points inside simple polygons
- The Approximability of the Binary Paintshop Problem
- Reachable region query and its applications
- On vertex guarding staircase polygons
- Vertex guarding in weak visibility polygons
This page was built for publication: An approximation algorithm for the art gallery problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580094)
