Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem (Q437058): Difference between revisions

@@ Property / cites work @@
+Q5692521
@@ Property / cites work: Q5692521 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks
+Normal rank
@@ Property / cites work @@
+Unit disk graphs
@@ Property / cites work: Unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Constant-time distributed dominating set approximation
+Normal rank
@@ Property / cites work @@
+Improving construction for connected dominating set with Steiner tree in wireless sensor networks
+Normal rank
@@ Property / cites work @@
+A greedy approximation for minimum connected dominating sets
+Normal rank
@@ Property / cites work @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / cites work: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
+Normal rank