Compact name-independent routing with minimum stretch

Given a weighted undirected network with arbitrary node names, we present a compact routing scheme, using a(√n,) space routing table at each node, and routing along paths of stretch 3, that is, at ...