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]
@inproceedings{CallH11, title = {Complexity of Inverse Shortest Path Routing}, author = {Mikael Call and Kaj Holmberg}, year = {2011}, doi = {10.1007/978-3-642-21527-8_39}, url = {http://dx.doi.org/10.1007/978-3-642-21527-8_39}, researchr = {https://researchr.org/publication/CallH11}, cites = {0}, citedby = {0}, pages = {339-353}, booktitle = {Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings}, editor = {Julia Pahl and Torsten Reiners and Stefan Voß}, volume = {6701}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-642-21526-1}, }