An Appraisal of Some Shortest-Path Algorithms
The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
This paper treats five discrete shortest-path problems: (1) determining the shortest path between two specified nodes of a network; (2) determining the shortest paths between all pairs of nodes of a network; (3) determining the second, third, etc., shortest path; (4) determining the fastest path through a network with travel times depending on the departure time; and (5) finding the shortest path between specified endpoints that passes through specified intermediate nodes. Existing good algorithms are identified while some others are modified to yield efficient procedures. Also, certain misrepresentations and errors in the literature are demonstrated.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 29,065
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
Floyd, R. W. (1962) · Communications of the ACM · doi:10.1145/367766.368168 · Cited by 3,998
Bellman, R. (1958) · Quarterly of Applied Mathematics · doi:10.1090/qam/102435 · Cited by 2,758
Warshall, S. (1962) · Journal of the ACM · doi:10.1145/321105.321107 · Cited by 1,683
The shortest path through a maze
Moore, E. (1959) · Medical Entomology and Zoology · Cited by 1,236
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
Solutions of the Shortest-Route Problem—A Review
Pollack, M., & Wiebenson, W. (1960) · Operations Research · doi:10.1287/opre.8.2.224 · Cited by 114
A Method for Finding the Shortest Route Through a Road Network
Whiting, P., & Hillier, J. A. (1960) · Journal of the Operational Research Society · doi:10.1057/jors.1960.32 · Cited by 63
Cited by
Finding the K Shortest Loopless Paths in a Network
Yen, J. Y. (1971) · Management Science · doi:10.1287/mnsc.17.11.712 · Cited by 2,618
Eppstein, D. (1998) · SIAM Journal on Computing · doi:10.1137/s0097539795290477 · Cited by 1,381
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
Efficient Algorithms for Shortest Paths in Sparse Networks
Johnson, D. B. (1977) · Journal of the ACM · doi:10.1145/321992.321993 · Cited by 1,041
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Metadata
- Authors
- Dreyfus, S. E.
- Venue
- Operations Research
- Published
- 1969-06
- Volume
- 17
- Issue
- 3
- Pages
- 395-412
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2144050074
- Cited by
- 1,002
- References
- 9
- FWCI
- 16.19
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.