Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- 1 July 1990
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 37 (3), 607-625
- https://doi.org/10.1145/79147.214078
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Shortest‐path algorithms: Taxonomy and annotationNetworks, 1984
- Distributed network protocolsIEEE Transactions on Information Theory, 1983
- Flow Control: A Comparative SurveyIEEE Transactions on Communications, 1980
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- The shortest route through a network with time-dependent internodal transit timesJournal of Mathematical Analysis and Applications, 1966
- Constructing Maximal Dynamic Flows from Static FlowsOperations Research, 1958