1 paper
Yung-Fu Chen, Sen Lin, Anish Arora
We propose a simple algorithm that needs only a few data samples from a single graph for learning local routing policies that generalize across a rich class of geometric random gra…