Learning from A Single Graph is All You Need for Near-Shortest Path Routing in Wireless Networks

Yung-Fu Chen, Sen Lin, Anish Arora

We propose a learning algorithm for local routing policies that needs only a few data samples obtained from a single graph while generalizing to all random graphs in a standard mod…