On the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing.

Reuven Cohen, Gabi Nakibly

Browse the full INFOCOM paper archive.