Approximation algorithms for art gallery problems in polygons
type: Item
instance of: scholarly article
title: Approximation algorithms for art gallery problems in polygons
zbMATH Open document ID: 1189.52008
author: Subir Kumar Ghosh
published in: Discrete Applied Mathematics
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 52A27
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5703776
zbMATH Keywords: approximation algorithms
zbMATH Keywords: computational geometry
zbMATH Keywords: art gallery problems
zbMATH Keywords: visibility polygons
zbMATH Keywords: minimum set cover
zbMATH Keywords: greedy algorithms
MaRDI profile type: Publication
full work available at URL: j.dam.2009.12.004
OpenAlex ID: W2153108139
Wikidata QID: Q56700240
cites work: Visibility of disjoint polygons
cites work: A linear-time approximation algorithm for the weighted vertex cover problem
cites work: A Constant‐Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding
cites work: Edge guards in rectilinear polygons
cites work: An efficient algorithm for guard placement in polygons with holes
cites work: Efficient visibility queries in simple polygons
cites work: A combinatorial theorem in plane geometry
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Improved approximation algorithms for geometric set cover
cites work: Guarding galleries and terrains
cites work: Approximation algorithms for terrain guarding.
cites work: Inapproximability results for guarding polygons and terrains
cites work: Improved Approximations for Guarding 1.5-Dimensional Terrains
cites work: Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition
cites work: A short proof of Chvatal's Watchman Theorem
cites work: Q4198056
cites work: Visibility Algorithms in the Plane
cites work: An Approximation Scheme for Terrain Guarding
cites work: Generalized guarding and partitioning for rectilinear polygons
cites work: Q3050374
cites work: Approximation algorithms for combinatorial problems
cites work: Traditional Galleries Require Fewer Watchmen
cites work: On guarding the vertices of rectilinear domains
cites work: A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains
cites work: Visibility of a simple polygon
cites work: Computational complexity of art gallery problems
cites work: On the ratio of optimal integral and fractional covers
cites work: Automata, Languages and Programming
cites work: An alternative proof of the rectilinear art gallery theorem
cites work: Galleries need fewer mobile guards: A variation on Chvatal's theorem
cites work: Q3799261
cites work: Some NP-hard polygon decomposition problems
cites work: Q3795225
cites work: Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
cites work: Q4945523
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
DBLP publication ID: journals/dam/Ghosh10
DOI: 10.1016/J.DAM.2009.12.004
description: scientific article; zbMATH DE number 5703776