LINEAR-TIME 3-APPROXIMATION ALGORITHM FOR THE r-STAR COVERING PROBLEM (Q4650093): Difference between revisions

@@ Property / author @@
+Andrzej Lingas
@@ Property / author: Andrzej Lingas / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+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 @@
+Covering Polygons Is Hard
@@ Property / cites work: Covering Polygons Is Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect Graphs and Orthogonally Convex Covers
@@ Property / cites work: Perfect Graphs and Orthogonally Convex Covers / rank @@
+Normal rank
@@ Property / cites work @@
+POLYGON DECOMPOSITION AND THE ORTHOGONAL ART GALLERY PROBLEM
+Normal rank
@@ Property / cites work @@
+Covering orthogonal polygons with star polygons: The perfect graph approach
+Normal rank
@@ Property / cites work @@
+On covering orthogonal polygons with star-shaped polygons
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s021819591250001x
+Normal rank
@@ Property / OpenAlex ID @@
+W1979511537
@@ Property / OpenAlex ID: W1979511537 / rank @@
+Normal rank