Minimum power assignment in wireless ad hoc networks with spanner property (Q857765): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-006-5980-0
+Normal rank
@@ Property / OpenAlex ID @@
+W3022401834
@@ Property / OpenAlex ID: W3022401834 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234097
@@ Property / cites work: Q4234097 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for minimum-cost k-vertex connected subgraphs
+Normal rank
@@ Property / cites work @@
+Q4501569
@@ Property / cites work: Q4501569 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2753931
@@ Property / cites work: Q2753931 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2762500
@@ Property / cites work: Q2762500 / rank @@
+Normal rank
@@ Property / cites work @@
+Fault-tolerant geometric spanners
@@ Property / cites work: Fault-tolerant geometric spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Q2721991
@@ Property / cites work: Q2721991 / rank @@
+Normal rank
@@ Property / cites work @@
+Power consumption in packet radio networks
@@ Property / cites work: Power consumption in packet radio networks / rank @@
+Normal rank
@@ Property / cites work @@
+EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER
+Normal rank
@@ Property / cites work @@
+Minimum-energy broadcasting in static ad hoc wireless networks
+Normal rank
@@ Property / cites work @@
+On Constructing Minimum Spanning Trees in <i>k</i>-Dimensional Spaces and Related Problems
+Normal rank