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