Optimum inapproximability results for finding minimum hidden guard sets in polygons and terrains
From MaRDI portal
Recommendations
- Finding minimum hidden guard sets in polygons --- tight approximability results
- Inapproximability results for guarding polygons and terrains
- Approximation algorithms to minimum vertex cover problems on polygons and terrains
- Inapproximability of finding maximum hidden sets on polygons and terrains
- Approximability of guarding weak visibility polygons
Cited in
(7)- Hiding people in polygons
- A finite dominating set of cardinality \(O(k)\) and a witness set of cardinality \(O(n)\) for 1.5D terrain guarding problem
- Finding minimum hidden guard sets in polygons --- tight approximability results
- Towards optimal positioning of surveillance UGVs
- Optimal Guard Placement Problem Under L-Visibility
- Inapproximability results for guarding polygons and terrains
- Inapproximability of finding maximum hidden sets on polygons and terrains
This page was built for publication: Optimum inapproximability results for finding minimum hidden guard sets in polygons and terrains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046478)