Geometric red-blue set cover for unit squares and related problems (Q2341691): Difference between revisions

@@ Property / cites work @@
+Q4952637
@@ Property / cites work: Q4952637 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-time approximation schemes for packing and piercing fat objects
+Normal rank
@@ Property / cites work @@
+Unit disk graphs
@@ Property / cites work: Unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Combination Can Be Hard: Approximability of the Unique Coverage Problem
+Normal rank
@@ Property / cites work @@
+Q3579437
@@ Property / cites work: Q3579437 / rank @@
+Normal rank
@@ Property / cites work @@
+PTAS for Weighted Set Cover on Unit Squares
@@ Property / cites work: PTAS for Weighted Set Cover on Unit Squares / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for partial covering problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation schemes for covering and packing problems in image processing and VLSI
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Approximation Scheme for the Geometric Unique Coverage Problem on Unit Squares
+Normal rank
@@ Property / cites work @@
+Improved results on geometric hitting set problems
+Normal rank