Sándor P. Fekete, Winfried Hochstättler, Stephan Kromberg, Christoph Moll. The complexity of an inverse shortest paths problem. In Ronald L. Graham, Jan Kratochvíl, Jaroslav Nesetril, Fred S. Roberts, editors, Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, Proceedings of a DIMACS Workshop, Stirín Castle, Czech Republic, May 19-25, 1997. Volume 49 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 113-128, DIMACS/AMS, 1997.
@inproceedings{FeketeHKM97,
title = {The complexity of an inverse shortest paths problem},
author = {Sándor P. Fekete and Winfried Hochstättler and Stephan Kromberg and Christoph Moll},
year = {1997},
researchr = {https://researchr.org/publication/FeketeHKM97},
cites = {0},
citedby = {0},
pages = {113-128},
booktitle = {Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, Proceedings of a DIMACS Workshop, Stirín Castle, Czech Republic, May 19-25, 1997},
editor = {Ronald L. Graham and Jan Kratochvíl and Jaroslav Nesetril and Fred S. Roberts},
volume = {49},
series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
publisher = {DIMACS/AMS},
}