Pages that link to "Item:Q5946124"
From MaRDI portal
The following pages link to Inapproximability results for guarding polygons and terrains (Q5946124):
Displaying 39 items.
- A nearly optimal algorithm for covering the interior of an art gallery (Q632590) (← links)
- Improved approximation for guarding simple galleries from the perimeter (Q635755) (← links)
- Facets for art gallery problems (Q747627) (← links)
- A nearly optimal sensor placement algorithm for boundary coverage (Q941574) (← links)
- Approximation algorithms for art gallery problems in polygons (Q968202) (← links)
- Optimum placement of guards (Q1328566) (← links)
- Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation (Q1755780) (← links)
- A constant-factor approximation algorithm for vertex guarding a WV-polygon (Q2117689) (← links)
- Vertex-to-point conflict-free chromatic guarding is NP-hard (Q2154089) (← links)
- Finding minimum witness sets in orthogonal polygons (Q2206742) (← links)
- An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries (Q2340409) (← links)
- Approximability of guarding weak visibility polygons (Q2357167) (← links)
- On boundaries of highly visible spaces and applications (Q2368974) (← links)
- Approximate guarding of monotone and rectilinear polygons (Q2375947) (← links)
- Maximizing the guarded boundary of an Art Gallery is APX-complete (Q2385696) (← links)
- Algorithms for art gallery illumination (Q2397430) (← links)
- A finite dominating set of cardinality \(O(k)\) and a witness set of cardinality \(O(n)\) for 1.5D terrain guarding problem (Q2400004) (← links)
- On guarding the vertices of rectilinear domains (Q2477198) (← links)
- Finding minimum hidden guard sets in polygons --- tight approximability results (Q2489014) (← links)
- On orthogonally guarding orthogonal polygons with bounded treewidth (Q2659775) (← links)
- Multi-agent deployment for visibility coverage in polygonal environments with holes (Q2904000) (← links)
- Computational Complexity of the $$r$$-visibility Guard Set Problem for Polyominoes (Q2945667) (← links)
- On Guarding Orthogonal Polygons with Sliding Cameras (Q2980898) (← links)
- Guarding Art Galleries: The Extra Cost for Sculptures Is Linear (Q3512447) (← links)
- A note on the lower bound of edge guards of polyhedral terrains (Q3630029) (← links)
- On The Lower Bound Of Edge Guards Of Polyhedral Terrains (Q4449511) (← links)
- Parameterized Hardness of Art Gallery Problems (Q4606288) (← links)
- How to Keep an Eye on Small Things (Q5012868) (← links)
- Parameterized Analysis of Art Gallery and Terrain Guarding (Q5042224) (← links)
- Guarding a Polygon Without Losing Touch (Q5100952) (← links)
- (Q5115778) (← links)
- Terrain-like graphs: PTASs for guarding weakly-visible polygons and terrains (Q5918442) (← links)
- Inapproximability of finding maximum hidden sets on polygons and terrains (Q5959557) (← links)
- Illumination in the presence of opaque line segments in the plane (Q5959562) (← links)
- Guarding a terrain by two watchtowers (Q5961974) (← links)
- The parameterized complexity of guarding almost convex polygons (Q6191439) (← links)
- Topological art in simple galleries (Q6204773) (← links)
- A practical algorithm with performance guarantees for the art gallery problem (Q6599806) (← links)
- Observation routes and external watchman routes (Q6633574) (← links)