Guarding orthogonal art galleries with sliding $k$-transmitters: hardness and approximation (Q1755780): Difference between revisions

@@ Property / author @@
-Therese C. Biedl
@@ Property / author: Therese C. Biedl / rank @@
-Normal rank
@@ Property / author @@
-Stephanie Tien Lee
@@ Property / author: Stephanie Tien Lee / rank @@
-Normal rank
@@ Property / author @@
+Therese C. Biedl
@@ Property / author: Therese C. Biedl / rank @@
+Normal rank
@@ Property / author @@
+Stephanie Tien Lee
@@ Property / author: Stephanie Tien Lee / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-018-0433-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2790698188
@@ Property / OpenAlex ID: W2790698188 / rank @@
+Normal rank
@@ Property / cites work @@
+Modem illumination of monotone polygons
@@ Property / cites work: Modem illumination of monotone polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Coverage with \(k\)-transmitters in the presence of obstacles
+Normal rank
@@ Property / cites work @@
+On Guarding Orthogonal Polygons with Sliding Cameras
+Normal rank
@@ Property / cites work @@
+On triangulating planar graphs under the four-connectivity constraint
+Normal rank
@@ Property / cites work @@
+Q4636499
@@ Property / cites work: Q4636499 / rank @@
+Normal rank
@@ Property / cites work @@
+Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation
+Normal rank
@@ Property / cites work @@
+Almost optimal set covers in finite VC-dimension
@@ Property / cites work: Almost optimal set covers in finite VC-dimension / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorics and complexity of guarding polygons with edge and point 2-transmitters
+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 @@
+Improved approximation algorithms for geometric set cover
+Normal rank
@@ Property / cites work @@
+Guarding monotone art galleries with sliding cameras in linear time
+Normal rank
@@ Property / cites work @@
+A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras
+Normal rank
@@ Property / cites work @@
+Guarding orthogonal art galleries with sliding cameras
+Normal rank
@@ Property / cites work @@
+Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results
+Normal rank
@@ Property / cites work @@
+Inapproximability results for guarding polygons and terrains
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Traditional Galleries Require Fewer Watchmen
@@ Property / cites work: Traditional Galleries Require Fewer Watchmen / rank @@
+Normal rank
@@ Property / cites work @@
+Orthogonal segment stabbing
@@ Property / cites work: Orthogonal segment stabbing / rank @@
+Normal rank
@@ Property / cites work @@
+GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS
+Normal rank
@@ Property / cites work @@
+An \(O(\lg \lg {\mathrm {OPT}})\)-approximation algorithm for multi-guarding galleries
+Normal rank
@@ Property / cites work @@
+Approximate guarding of monotone and rectilinear polygons
+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 @@
+An alternative proof of the rectilinear art gallery theorem
+Normal rank
@@ Property / cites work @@
+Galleries need fewer mobile guards: A variation on Chvatal's theorem
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+Two NP‐Hard Art‐Gallery Problems for Ortho‐Polygons
+Normal rank
@@ Property / cites work @@
+A unified approach to visibility representations of planar graphs
+Normal rank
@@ Property / cites work @@
+Guarding Thin Orthogonal Polygons Is Hard
@@ Property / cites work: Guarding Thin Orthogonal Polygons Is Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945523
@@ Property / cites work: Q4945523 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1755780

Guarding orthogonal art galleries with sliding \(k\)-transmitters: hardness and approximation (Q1755780): Difference between revisions

Latest revision as of 19:47, 17 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)