On the computational complexity and effectiveness of N-hub shortest-path routing

Reuven Cohen, Gabi Nakibly. On the computational complexity and effectiveness of N-hub shortest-path routing. IEEE/ACM Trans. Netw., 16(3):691-704, 2008. [doi]

Abstract

Abstract is missing.