A nearly optimal sensor placement algorithm for boundary coverage (Q941574): Difference between revisions

@@ Property / cites work @@
+Covering Polygons Is Hard
@@ Property / cites work: Covering Polygons Is Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q3799261
@@ Property / cites work: Q3799261 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945523
@@ Property / cites work: Q4945523 / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability results for guarding polygons and terrains
+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 @@
+An efficient algorithm for guard placement in polygons with holes
+Normal rank
@@ Property / cites work @@
+Guarding galleries and terrains
@@ Property / cites work: Guarding galleries and terrains / rank @@
+Normal rank
@@ Property / cites work @@
+LOCATING GUARDS FOR VISIBILITY COVERAGE OF POLYGONS
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for detecting weak visibility of a polygon
+Normal rank
@@ Property / cites work @@
+A fast algorithm for the maximum clique problem
@@ Property / cites work: A fast algorithm for the maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for finding a maximum clique in a graph
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the maximum clique problem
@@ Property / cites work: An exact algorithm for the maximum clique problem / rank @@
+Normal rank