A constant-factor approximation algorithm for vertex guarding a WV-polygon
From MaRDI portal
Publication:2117689
Cites work
- scientific article; zbMATH DE number 4050998 (Why is no real title available?)
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 753969 (Why is no real title available?)
- A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
- An approximation algorithm for the art gallery problem
- Approximability of guarding weak visibility polygons
- Approximate guarding of monotone and rectilinear polygons
- Approximation algorithms for art gallery problems in polygons
- Characterizing and recognizing weak visibility polygons
- Computational complexity of art gallery problems
- Corrections to Lee's visibility polygon algorithm
- Guarding galleries and terrains
- Guarding terrains via local search
- Improved approximation for guarding simple galleries from the perimeter
- Inapproximability results for guarding polygons and terrains
- PTAS for geometric hitting set problems via local search
- Some NP-hard polygon decomposition problems
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
- The art gallery problem is \(\exists \mathbb{R}\)-complete
- The continuous 1.5D terrain guarding problem: discretization, optimal solutions, and PTAS
- Visibility of a simple polygon
This page was built for publication: A constant-factor approximation algorithm for vertex guarding a WV-polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117689)
