Finding minimum hidden guard sets in polygons --- tight approximability results
From MaRDI portal
Publication:2489014
Recommendations
Cites work
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 1424310 (Why is no real title available?)
- Approximating the minimum maximal independence number
- Approximation algorithms for NP-hard problems.
- Approximation algorithms for terrain guarding.
- Automata, Languages and Programming
- Computational complexity of art gallery problems
- Hiding people in polygons
- Inapproximability of finding maximum hidden sets on polygons and terrains
- Inapproximability results for guarding polygons and terrains
- On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time
Cited in
(4)
This page was built for publication: Finding minimum hidden guard sets in polygons --- tight approximability results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489014)