External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Mikael Call

This author has not been identified. Look up 'Mikael Call' in Google

Kaj Holmberg

This author has not been identified. Look up 'Kaj Holmberg' in Google
runs on