The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Open accessAbstract
In this paper the shortest-path problem in networks in which the delay (or weight) of the edges changes with time according to arbitrary functions is considered. Algorithms for finding the shortest path and minimum delay under various waiting constraints are presented and the properties of the derived path are investigated. It is shown that if departure time from the source node is unrestricted, then a shortest path can be found that is simple and achieves a delay as short as the most unrestricted path. In the case of restricted transit, it is shown that there exist cases in which the minimum delay is finite, but the path that achieves it is infinite.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
Ford, D. R., & Fulkerson, D. R. (1962) · Cited by 4,072
Even, S. (1979) · Cited by 1,280
An Appraisal of Some Shortest-Path Algorithms
Dreyfus, S. E. (1969) · Operations Research · doi:10.1287/opre.17.3.395 · Cited by 1,002
The New Routing Algorithm for the ARPANET
McQuillan, J., Richer, I., & Rosen, E. (1980) · IEEE Transactions on Communications · doi:10.1109/tcom.1980.1094721 · Cited by 686
The shortest route through a network with time-dependent internodal transit times
Cooke, K. L., & Halsey, E. (1966) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(66)90009-6 · Cited by 412
Shortest‐path algorithms: Taxonomy and annotation
Deo, N., & Pang, C. (1984) · Networks · doi:10.1002/net.3230140208 · Cited by 309
Minimum weight paths in time‐dependent networks
Orda, A., & Rom, R. (1991) · Networks · doi:10.1002/net.3230210304 · Cited by 148
Self-citation
Cited by
T-drive: driving directions based on taxi trajectories
Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., & Huang, Y. (2010) · Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems · doi:10.1145/1869790.1869807 · Cited by 1,105
Driving with knowledge from the physical world
Yuan, J., Zheng, Y., Xie, X., & Sun, G. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020462 · Cited by 849
Route Planning in Transportation Networks
Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_2 · Cited by 610
Engineering Route Planning Algorithms
Delling, D., Sanders, P., Schultes, D., & Wagner, D. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-02094-0_7 · Cited by 454
T-Drive: Enhancing Driving Directions with Taxi Drivers' Intelligence
Yuan, J., Zheng, Y., Xie, X., & Sun, G. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.200 · Cited by 396
Metadata
- Authors
- Orda, A., & Rom, R.
- Venue
- Journal of the ACM
- Published
- 1990-07
- Volume
- 37
- Issue
- 3
- Pages
- 607-625
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2089338760
- Cited by
- 483
- References
- 8
- FWCI
- 3.90
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. https://app.cochat.ai/papers/10.1145/79147.214078
- The paper
- Orda, A., & Rom, R. (1990). Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of the ACM. https://doi.org/10.1145/79147.214078
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.