Routing schemes for hybrid communication networks (Q6145044): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2023.114352
@@ Property / DOI: 10.1016/j.tcs.2023.114352 / rank @@
-Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2023.114352
@@ Property / DOI: 10.1016/J.TCS.2023.114352 / rank @@
+Normal rank
@@ Property / cites work @@
+Q6061689
@@ Property / cites work: Q6061689 / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest Paths in a Hybrid Network Model
@@ Property / cites work: Shortest Paths in a Hybrid Network Model / rank @@
+Normal rank
@@ Property / cites work @@
+Routing with guaranteed delivery in ad hoc wireless networks
+Normal rank
@@ Property / cites work @@
+A bounding box overlay for competitive routing in hybrid communication networks
+Normal rank
@@ Property / cites work @@
+On Efficient Distributed Construction of Near Optimal Routing Schemes
+Normal rank
@@ Property / cites work @@
+Plain SINR is Enough!
@@ Property / cites work: Plain SINR is Enough! / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Shortest Paths and Diameter in the Hybrid Network Model
+Normal rank
@@ Property / cites work @@
+Geometric ad-hoc routing
@@ Property / cites work: Geometric ad-hoc routing / rank @@
+Normal rank
@@ Property / cites work @@
+Fast routing table construction using small messages
+Normal rank
@@ Property / cites work @@
+Fast Partial Distance Estimation and Applications
@@ Property / cites work: Fast Partial Distance Estimation and Applications / rank @@
+Normal rank
@@ Property / cites work @@
+Q3126969
@@ Property / cites work: Q3126969 / rank @@
+Normal rank
@@ Property / cites work @@
+Undirected (1+             <i>𝜀</i>             )-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms
+Normal rank
@@ Property / cites work @@
+Distributed Verification and Hardness of Distributed Approximation
+Normal rank