Back to Results
First PageMeta Content
Routing algorithms / Mathematics / Wireless networking / Computing / Routing protocols / Graph theory / Network theory / Edsger W. Dijkstra / Geographic routing / Greedy algorithm / Routing / Shortest path problem


Worst-Case Optimal and Average-Case Efficient ∗ Geometric Ad-Hoc Routing Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger Department of Computer Science ETH Zurich
Add to Reading List

Document Date: 2014-09-26 08:36:29


Open Document

File Size: 370,78 KB

Share Result on Facebook