On approximating MIS over B1-VPG graphs* (Q5057743): Difference between revisions

@@ Property / cites work @@
+Vertex Intersection Graphs of Paths on a Grid
@@ Property / cites work: Vertex Intersection Graphs of Paths on a Grid / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for B 1-EPG Graphs
@@ Property / cites work: Approximation Algorithms for B 1-EPG Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Intersection graphs of L-shapes and segments in the plane
+Normal rank
@@ Property / cites work @@
+Q5365106
@@ Property / cites work: Q5365106 / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Approximation schemes for covering and packing problems in image processing and VLSI
+Normal rank
@@ Property / cites work @@
+An algorithm for the maximum weight independent set problem on outerstring graphs
+Normal rank
@@ Property / cites work @@
+Finding a maximum independent set in a permutation graph
+Normal rank
@@ Property / cites work @@
+Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs
+Normal rank
@@ Property / cites work @@
+Modular decomposition and transitive orientation
@@ Property / cites work: Modular decomposition and transitive orientation / rank @@
+Normal rank
@@ Property / cites work @@
+The max clique problem in classes of string-graphs
+Normal rank
@@ Property / cites work @@
+On approximating MIS over B1-VPG graphs*
@@ Property / cites work: On approximating MIS over B1-VPG graphs* / rank @@
+Normal rank