Universal guard problems
From MaRDI portal
Publication:3177901
DOI10.1142/S0218195918600038zbMATH Open1397.68201OpenAlexW2559120098WikidataQ129561379 ScholiaQ129561379MaRDI QIDQ3177901FDOQ3177901
Qian Li, Sándor P. Fekete, Joseph S. B. Mitchell, Christian Scheffer
Publication date: 2 August 2018
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195918600038
Recommendations
Cites Work
- A short proof of Chvatal's Watchman Theorem
- Almost optimal set covers in finite VC-dimension
- Terrain Guarding is NP-Hard
- Title not available (Why is that?)
- An exact algorithm for minimizing vertex guards on art galleries
- Approximation algorithms for art gallery problems in polygons
- Universal approximations for TSP, Steiner tree, and set cover
- Improved lower and upper bounds for universal TSP in planar metrics
- A combinatorial theorem in plane geometry
- Algorithms for polytope covering and approximation
- Guarding galleries and terrains
- Improved approximation for guarding simple galleries from the perimeter
- Title not available (Why is that?)
- LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS
- Exact solutions and bounds for general art gallery problems
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
- Guarding terrains via local search
- Facets for art gallery problems
- A randomized art-gallery algorithm for sensor placement
Cited In (2)
This page was built for publication: Universal guard problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177901)
