NP-Completeness Results for All-Shortest-Path Interval Routing. - Rui Wang 009; Francis C. M. Lau 001; Yan Yan Liu (SIROCCO, 2004)

On the hardness of minimizing space for all-shortest-path interval routing schemes. - Rui Wang 009; Francis C. M. Lau 001; Yan Yan Liu (Theor. Comput. Sci., 2007)