Universal guard problems
From MaRDI portal
Publication:3177901
Recommendations
Cites work
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 1424299 (Why is no real title available?)
- A combinatorial theorem in plane geometry
- A randomized art-gallery algorithm for sensor placement
- A short proof of Chvatal's Watchman Theorem
- Algorithms for polytope covering and approximation
- Almost optimal set covers in finite VC-dimension
- An exact algorithm for minimizing vertex guards on art galleries
- Approximation algorithms for art gallery problems in polygons
- Exact solutions and bounds for general art gallery problems
- Facets for art gallery problems
- Guarding galleries and terrains
- Guarding terrains via local search
- Improved approximation for guarding simple galleries from the perimeter
- Improved lower and upper bounds for universal TSP in planar metrics
- Locating guards for visibility coverage of polygons
- POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
- Terrain guarding is NP-hard
- Universal approximations for TSP, Steiner tree, and set cover
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)