Exact algorithms for terrain guarding
From MaRDI portal
Publication:4554352
Recommendations
Cited in
(14)- Terrain guarding is NP-hard
- The continuous 1.5D terrain guarding problem: discretization, optimal solutions, and PTAS
- One-sided discrete terrain guarding and chordal graphs
- Parameterized Analysis of Art Gallery and Terrain Guarding
- Parameter analysis for guarding terrains
- One-sided terrain guarding and chordal graphs
- Exact algorithms for terrain guarding
- Orthogonal terrain guarding is NP-complete
- scientific article; zbMATH DE number 6297811 (Why is no real title available?)
- 1.5D terrain guarding problem parameterized by guard range
- A fixed-parameter algorithm for guarding 1.5D terrains
- Parameter analysis for guarding terrains
- Clique-width of point configurations
- scientific article; zbMATH DE number 7236415 (Why is no real title available?)
This page was built for publication: Exact algorithms for terrain guarding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554352)