On Some City Guarding Problems
From MaRDI portal
Recommendations
- The guarding problem -- complexity and approximation
- scientific article; zbMATH DE number 969102
- Algorithms and Computation
- Complexity of minimum corridor guarding problems
- Approximability issues of guarding a set of segments
- On a generalized lifeguard problem
- A generalized fortress problem using \(k\)-consecutive vertex guards
- AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
- scientific article; zbMATH DE number 7644063
Cites work
- A combinatorial theorem in plane geometry
- A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems
- An alternative proof of the rectilinear art gallery theorem
- An art gallery theorem for line segments in the plane
- Computational complexity of art gallery problems
- Galleries need fewer mobile guards: A variation on Chvatal's theorem
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 177851 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1424310 (Why is no real title available?)
- On gallery watchmen in grids
- Orthogonal art galleries with holes: a coloring proof of Aggarwal's theorem
- Traditional Galleries Require Fewer Watchmen
Cited in
(4)
This page was built for publication: On Some City Guarding Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511372)