Complexity of Inverse Shortest Path Routing

Mikael Call, Kaj Holmberg. Complexity of Inverse Shortest Path Routing. In Julia Pahl, Torsten Reiners, Stefan Voß, editors, Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings. Volume 6701 of Lecture Notes in Computer Science, pages 339-353, Springer, 2011. [doi]

Abstract

Abstract is missing.