A linear-time heuristic for minimum rectangular coverings (Extended abstract) (Q5055944): Difference between revisions

@@ Property / cites work @@
+Covering Polygons Is Hard
@@ Property / cites work: Covering Polygons Is Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Performance Guarantees on a Sweep-Line Heuristic for Covering Rectilinear Polygons with Rectangles
+Normal rank
@@ Property / cites work @@
+Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
+Normal rank
@@ Property / cites work @@
+Q3693536
@@ Property / cites work: Q3693536 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time heuristic for minimum rectangular coverings (Extended abstract)
+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 @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank