A constant-factor approximation algorithm for vertex guarding a WV-polygon
From MaRDI portal
Publication:2117689
DOI10.1007/978-3-030-80879-2_6OpenAlexW3184578342MaRDI QIDQ2117689FDOQ2117689
Authors: Stav Ashur, Omrit Filtser, Matthew J. Katz 
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/1907.01228
Cites Work
- Title not available (Why is that?)
- Approximation algorithms for art gallery problems in polygons
- Some NP-hard polygon decomposition problems
- Guarding galleries and terrains
- Improved approximation for guarding simple galleries from the perimeter
- Corrections to Lee's visibility polygon algorithm
- PTAS for geometric hitting set problems via local search
- Visibility of a simple polygon
- Guarding terrains via local search
- A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
- An approximation algorithm for the art gallery problem
- Inapproximability results for guarding polygons and terrains
- Computational complexity of art gallery problems
- Characterizing and recognizing weak visibility polygons
- Title not available (Why is that?)
- The continuous 1.5D terrain guarding problem: discretization, optimal solutions, and PTAS
- Title not available (Why is that?)
- Approximate guarding of monotone and rectilinear polygons
- The art gallery problem is \(\exists \mathbb{R}\)-complete
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains
- Approximability of guarding weak visibility polygons
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)
