Weighted geometric set cover with rectangles of bounded integer side lengths (Q2133398): Difference between revisions

@@ Property / cites work @@
+Exact algorithms and APX-hardness results for geometric packing and covering problems
+Normal rank
@@ Property / cites work @@
+Geometric red-blue set cover for unit squares and related problems
+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 @@
+Optimal packing and covering in the plane are NP-complete
+Normal rank
@@ Property / cites work @@
+The within-strip discrete unit disk cover problem
@@ Property / cites work: The within-strip discrete unit disk cover problem / rank @@
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+Approximation schemes for covering and packing problems in image processing and VLSI
+Normal rank
@@ Property / cites work @@
+\(\mathsf{NP}\)-hardness of geometric set cover and hitting set with rectangles containing a common point
+Normal rank
@@ Property / cites work @@
+Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line
+Normal rank
@@ Property / cites work @@
+Tight lower bounds for the size of epsilon-nets
@@ Property / cites work: Tight lower bounds for the size of epsilon-nets / rank @@
+Normal rank