Teofilo F. Gonzalez, David Serena. Complexity of pairwise shortest path routing in the grid. Theoretical Computer Science, 326(1-3):155-185, 2004. [doi]
@article{GonzalezS04:0,
title = {Complexity of pairwise shortest path routing in the grid},
author = {Teofilo F. Gonzalez and David Serena},
year = {2004},
doi = {10.1016/j.tcs.2004.06.027},
url = {http://dx.doi.org/10.1016/j.tcs.2004.06.027},
tags = {routing},
researchr = {https://researchr.org/publication/GonzalezS04%3A0},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {326},
number = {1-3},
pages = {155-185},
}