Approximability of guarding weak visibility polygons (Q2357167): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2016.12.015
+Normal rank
@@ Property / OpenAlex ID @@
+W2963195697
@@ Property / OpenAlex ID: W2963195697 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2754182
@@ Property / cites work: Q2754182 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex Guarding in Weak Visibility Polygons
@@ Property / cites work: Vertex Guarding in Weak Visibility Polygons / rank @@
+Normal rank
@@ Property / cites work @@
+OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS
+Normal rank
@@ Property / cites work @@
+A combinatorial theorem in plane geometry
@@ Property / cites work: A combinatorial theorem in plane geometry / rank @@
+Normal rank
@@ Property / cites work @@
+A Pseudopolynomial Time O(logn)-Approximation Algorithm for Art Gallery Problems
+Normal rank
@@ Property / cites work @@
+Analytical approach to parallel repetition
@@ Property / cites work: Analytical approach to parallel repetition / rank @@
+Normal rank
@@ Property / cites work @@
+Guarding galleries and terrains
@@ Property / cites work: Guarding galleries and terrains / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability results for guarding polygons and terrains
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+A short proof of Chvatal's Watchman Theorem
@@ Property / cites work: A short proof of Chvatal's Watchman Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Visibility Algorithms in the Plane
@@ Property / cites work: Visibility Algorithms in the Plane / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for art gallery problems in polygons
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Art Gallery Problems in Polygons and Terrains
+Normal rank
@@ Property / cites work @@
+Characterizing and recognizing weak visibility polygons
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+Normal rank
@@ Property / cites work @@
+Traditional Galleries Require Fewer Watchmen
@@ Property / cites work: Traditional Galleries Require Fewer Watchmen / rank @@
+Normal rank
@@ Property / cites work @@
+On guarding the vertices of rectilinear domains
@@ Property / cites work: On guarding the vertices of rectilinear domains / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation for guarding simple galleries from the perimeter
+Normal rank
@@ Property / cites work @@
+Computational complexity of art gallery problems
@@ Property / cites work: Computational complexity of art gallery problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of locating linear facilities in the plane
+Normal rank
@@ Property / cites work @@
+An alternative proof of the rectilinear art gallery theorem
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+Some NP-hard polygon decomposition problems
@@ Property / cites work: Some NP-hard polygon decomposition problems / rank @@
+Normal rank
@@ Property / cites work @@
+Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
+Normal rank