Approximability issues of guarding a set of segments (Q2855782): Difference between revisions

@@ Property / cites work @@
+Algorithms for Reporting and Counting Geometric Intersections
+Normal rank
@@ Property / cites work @@
+Experimental Study on Approximation Algorithms for Guarding Sets of Line Segments
+Normal rank
@@ Property / cites work @@
+Guarding a set of line segments in the plane
@@ Property / cites work: Guarding a set of line segments in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for a geometric set cover problem
+Normal rank
@@ Property / cites work @@
+Solving NP-hard problems in 'almost trees': vertex cover
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems
+Normal rank
@@ Property / cites work @@
+On the Number of Husimi Trees
@@ Property / cites work: On the Number of Husimi Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Finding All the Elementary Circuits of a Directed Graph
+Normal rank
@@ Property / cites work @@
+Q4349924
@@ Property / cites work: Q4349924 / rank @@
+Normal rank
@@ Property / cites work @@
+Uniform random number generation
@@ Property / cites work: Uniform random number generation / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank