Colin Cooper, Alan M. Frieze, Kurt Mehlhorn, Volker Priebe. Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model. In José D. P. Rolim, editor, Randomization and Approximation Techniques in Computer Science, International Workshop, RANDOM 97, Bolognna, Italy, July 11-12. 1997, Proceedings. Volume 1269 of Lecture Notes in Computer Science, pages 15-26, Springer, 1997.
@inproceedings{CooperFMP97,
title = {Average-Case Complexity of Shortest-Paths Problems in the Vertex-Potential Model},
author = {Colin Cooper and Alan M. Frieze and Kurt Mehlhorn and Volker Priebe},
year = {1997},
researchr = {https://researchr.org/publication/CooperFMP97},
cites = {0},
citedby = {0},
pages = {15-26},
booktitle = {Randomization and Approximation Techniques in Computer Science, International Workshop, RANDOM 97, Bolognna, Italy, July 11-12. 1997, Proceedings},
editor = {José D. P. Rolim},
volume = {1269},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-63248-4},
}