A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph (Q5244687): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-1-4614-5131-0_9
+Normal rank
@@ Property / OpenAlex ID @@
+W84359630
@@ Property / OpenAlex ID: W84359630 / rank @@
+Normal rank
@@ 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 @@
+On minimum submodular cover with submodular cost
@@ Property / cites work: On minimum submodular cover with submodular cost / rank @@
+Normal rank
@@ Property / cites work @@
+PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks
+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 @@
+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 @@
+EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS
+Normal rank
@@ Property / cites work @@
+Minimum connected dominating sets and maximal independent sets in unit disk graphs
+Normal rank
@@ Property / cites work @@
+A PTAS for minimum connected dominating set in 3-dimensional wireless sensor networks
+Normal rank