Parameter analysis for guarding terrains
From MaRDI portal
Publication:2118384
DOI10.1007/S00453-021-00913-9OpenAlexW4205847196MaRDI QIDQ2118384FDOQ2118384
Authors: Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi 
Publication date: 22 March 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-021-00913-9
Recommendations
- Parameter analysis for guarding terrains
- Parameterized Analysis of Art Gallery and Terrain Guarding
- An Approximation Scheme for Terrain Guarding
- A fixed-parameter algorithm for guarding 1.5D terrains
- Exact algorithms for terrain guarding
- Exact algorithms for terrain guarding
- Guarding polyhedral terrains
- 1.5D terrain guarding problem parameterized by guard range
Cites Work
- Fundamentals of parameterized complexity
- Title not available (Why is that?)
- On guarding the vertices of rectilinear domains
- Terrain guarding is NP-hard
- Title not available (Why is that?)
- Parameterized algorithms
- Improved approximation algorithms for geometric set cover
- A fixed-parameter algorithm for guarding 1.5D terrains
- A 4-Approximation Algorithm 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
- Guarding terrains via local search
- The continuous 1.5D terrain guarding problem: discretization, optimal solutions, and PTAS
- Exact algorithms for terrain guarding
- Title not available (Why is that?)
- Orthogonal terrain guarding is NP-complete
- Parameterized Hardness of Art Gallery Problems
- The Parameterized Complexity of Guarding Almost Convex Polygons.
Cited In (5)
This page was built for publication: Parameter analysis for guarding terrains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118384)
