A PTAS for a disc covering problem using width-bounded separators (Q2498985): 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.1007/s10878-006-7132-y
+Normal rank
@@ Property / OpenAlex ID @@
+W2060662766
@@ Property / OpenAlex ID: W2060662766 / 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
@@ links / mardi / name / links / mardi / name @@
+Publication:2498985