A PTAS for a disc covering problem using width-bounded separators (Q2498985): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-006-7132-y
@@ Property / DOI: 10.1007/s10878-006-7132-y / rank @@
-Normal rank
@@ Property / cites work @@
+Planar Separators
@@ Property / cites work: Planar Separators / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Science and Its Applications – ICCSA 2004
+Normal rank
@@ Property / cites work @@
+Q2708237
@@ Property / cites work: Q2708237 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Problem of Partitioning Planar Graphs
@@ Property / cites work: On the Problem of Partitioning Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4339095
@@ Property / cites work: Q4339095 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10878-006-7132-Y
@@ Property / DOI: 10.1007/S10878-006-7132-Y / rank @@
+Normal rank