The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
type: Item
instance of: scholarly article
title: The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
zbMATH Open document ID: 0776.90083
DOI: 10.1007/BF01299142
author: Richard V. Helgason
author: B. Douglas Stewart
author: Jeffery L. Kennington
published in: Computational Optimization and Applications
publication date: 1993-08-30T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 370412
zbMATH Keywords: shortest-path algorithms
zbMATH Keywords: parallel algorithm
zbMATH Keywords: heuristics
describes a project that uses: Algorithm 360
MaRDI profile type: Publication
cites work: On the shortest route through a network
cites work: Shortest-path algorithms: Taxonomy and annotation
cites work: A note on the partitioning shortest path algorithm
cites work: A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees
cites work: A note on two problems in connexion with graphs
cites work: Improvements for the thresh X2 shortest path algorithm
cites work: An Appraisal of Some Shortest-Path Algorithms
cites work: Q3883524
cites work: Shortest path methods: A unifying approach
cites work: New Polynomial Shortest Path Algorithms and Their Computational Attributes
cites work: Q4742310
cites work: Q3968759
cites work: Combinatorial optimization. Networks and matroids
cites work: A parallel shortest path algorithm
cites work: Finding the Shortest Route between Two Points in a Network
cites work: Q4217266
cites work: Q5679703
cites work: Q3773322
cites work: Q3730336
cites work: Q3707420
full work available at URL: https://doi.org/10.1007/bf01299142
OpenAlex ID: W2049802874
description: scientific article; zbMATH DE number 370412