Parameterized Hardness of Art Gallery Problems
From MaRDI portal
Publication:4606288
DOI10.4230/LIPIcs.ESA.2016.19zbMath1397.68091arXiv1603.08116OpenAlexW4391667035MaRDI QIDQ4606288
Édouard Bonnet, Tillmann Miltzow
Publication date: 2 March 2018
Full work available at URL: https://arxiv.org/abs/1603.08116
computational geometryart gallery problemparameterized complexityETH-based lower boundgeometric set cover/hitting set
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Guarding monotone art galleries with sliding cameras in linear time ⋮ Parameterized Analysis of Art Gallery and Terrain Guarding ⋮ The parameterized complexity of guarding almost convex polygons ⋮ Unnamed Item ⋮ Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) ⋮ On the Parameterized Complexity of Red-Blue Points Separation
This page was built for publication: Parameterized Hardness of Art Gallery Problems
