The complexity of an inverse shortest paths problem.
S. Fekete, W. Hochstättler, S. Kromberg, and C. Moll. Contemporary Trends in Discrete Mathematics, volume 49 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 113-127. DIMACS/AMS, (1997)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/dimacs/FeketeHKM97
%A Fekete, Sándor P.
%A Hochstättler, Winfried
%A Kromberg, Stephan
%A Moll, Christoph
%B Contemporary Trends in Discrete Mathematics
%D 1997
%E Graham, Ronald L.
%E Kratochvíl, Jan
%E Nesetril, Jaroslav
%E Roberts, Fred S.
%I DIMACS/AMS
%K dblp
%P 113-127
%T The complexity of an inverse shortest paths problem.
%U http://dblp.uni-trier.de/db/conf/dimacs/dimacs49.html#FeketeHKM97
%V 49
%@ 0-8218-0963-6
@inproceedings{conf/dimacs/FeketeHKM97,
added-at = {2022-06-09T00:00:00.000+0200},
author = {Fekete, Sándor P. and Hochstättler, Winfried and Kromberg, Stephan and Moll, Christoph},
biburl = {https://www.bibsonomy.org/bibtex/29d47972b28c99694e134c427e1366723/dblp},
booktitle = {Contemporary Trends in Discrete Mathematics},
crossref = {conf/dimacs/dimacs49},
editor = {Graham, Ronald L. and Kratochvíl, Jan and Nesetril, Jaroslav and Roberts, Fred S.},
ee = {https://doi.org/10.1090/dimacs/049/06},
interhash = {a7c9d9f9d4df8ccb91dc82c6a26f7d5d},
intrahash = {9d47972b28c99694e134c427e1366723},
isbn = {0-8218-0963-6},
keywords = {dblp},
pages = {113-127},
publisher = {DIMACS/AMS},
series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
timestamp = {2024-04-09T17:59:51.000+0200},
title = {The complexity of an inverse shortest paths problem.},
url = {http://dblp.uni-trier.de/db/conf/dimacs/dimacs49.html#FeketeHKM97},
volume = 49,
year = 1997
}
