$\mathsf{NP}$-hardness of geometric set cover and hitting set with rectangles containing a common point (Q1621499): Difference between revisions

@@ 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.1016/j.ipl.2018.09.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2891878174
@@ Property / OpenAlex ID: W2891878174 / rank @@
+Normal rank
@@ 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

\(\mathsf{NP}\)-hardness of geometric set cover and hitting set with rectangles containing a common point (Q1621499): Difference between revisions