Approximation for minimum strongly connected dominating and absorbing set with routing-cost constraint in disk digraphs (Q331973): Difference between revisions

@@ Property / cites work @@
+Wireless networking, dominating and packing
@@ Property / cites work: Wireless networking, dominating and packing / 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 @@
+Approximation algorithms for connected dominating sets
+Normal rank
@@ Property / cites work @@
+An exact algorithm for minimum CDS with shortest path constraint in wireless networks
+Normal rank
@@ Property / cites work @@
+Q3579442
@@ Property / cites work: Q3579442 / rank @@
+Normal rank
@@ Property / cites work @@
+A PTAS for minimum \(d\)-hop connected dominating set in growth-bounded graphs
+Normal rank
@@ Property / cites work @@
+Über die Einlagerung von Kreisen in einen konvexen Bereich
+Normal rank
@@ Property / cites work @@
+A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph
+Normal rank
@@ Property / cites work @@
+Algorithms for the minimum weight \(k\)-fold (connected) dominating set problem
+Normal rank
@@ Property / cites work @@
+An inequality in the geometry of numbers
@@ Property / cites work: An inequality in the geometry of numbers / rank @@
+Normal rank
@@ Property / cites work @@
+A greedy algorithm for the fault-tolerant connected dominating set in a general graph
+Normal rank
@@ Property / cites work @@
+EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS
+Normal rank