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]
@article{CohenN08:1,
title = {On the computational complexity and effectiveness of N-hub shortest-path routing},
author = {Reuven Cohen and Gabi Nakibly},
year = {2008},
doi = {10.1145/1399562.1399578},
url = {http://doi.acm.org/10.1145/1399562.1399578},
tags = {routing},
researchr = {https://researchr.org/publication/CohenN08%3A1},
cites = {0},
citedby = {0},
journal = {IEEE/ACM Trans. Netw.},
volume = {16},
number = {3},
pages = {691-704},
}