A better constant-factor approximation for weighted dominating set in unit disk graph (Q1037452): Difference between revisions

@@ Property / cites work @@
+Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+On approximation problems related to the independent set and vertex cover problems
+Normal rank
@@ Property / cites work @@
+Unit disk graphs
@@ Property / cites work: Unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228484
@@ Property / cites work: Q4228484 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation schemes for covering and packing problems in image processing and VLSI
+Normal rank
@@ Property / cites work @@
+NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Planar Formulae and Their Uses
@@ Property / cites work: Planar Formulae and Their Uses / rank @@
+Normal rank
@@ Property / cites work @@
+Simple heuristics for unit disk graphs
@@ Property / cites work: Simple heuristics for unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Chebyshev's approximation algorithms and applications
+Normal rank