Approximation algorithms for terrain guarding.
From MaRDI portal
Recommendations
- A constant-factor approximation algorithm for optimal terrain guarding
- A 4-Approximation Algorithm for Guarding 1.5-Dimensional Terrains
- Improved approximations for guarding 1.5-dimensional terrains
- Improved approximations for guarding 1.5-dimensional terrains
- A Constant‐Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding
Cites work
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 1256748 (Why is no real title available?)
- scientific article; zbMATH DE number 1559564 (Why is no real title available?)
- scientific article; zbMATH DE number 1424310 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- Approximation algorithms for combinatorial problems
- Computational complexity of art gallery problems
- Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time.
- Guarding polyhedral terrains
Cited in
(11)- An exact algorithm for minimizing vertex guards on art galleries
- Altitude terrain guarding and guarding uni-monotone polygons
- Approximation algorithms for art gallery problems in polygons
- Efficient parallel implementations of approximation algorithms for guarding 1.5D terrains
- Finding minimum hidden guard sets in polygons --- tight approximability results
- Towards optimal positioning of surveillance UGVs
- Inapproximability results for guarding polygons and terrains
- A finite dominating set of cardinality \(O(k)\) and a witness set of cardinality \(O(n)\) for 1.5D terrain guarding problem
- Guarding galleries and terrains
- ENERGY-AWARE STAGE ILLUMINATION
- GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST
This page was built for publication: Approximation algorithms for terrain guarding.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603553)
