The problem addressed in this paper is how to efficiently compute the approximate shortest paths of large-scale network. We propose the wholly new network-tree model (NTM) constructed from arbitrary network and associated approximate algorithms for high performance computation of shortest path in large-scale network. For the tradeoffs between the computational speed and errors, three approximate network-tree shortest path (ANTSP) algorithms are presented: nearest ANTSP, heuristic ANTSP and sub-optimal ANTSP algorithms. The experiment results based on grid network show that all ANTSP algorithms achieve much higher computational efficiency than Dijkstra algorithm, and the average errors of heuristic ANTSP and sub-optimal ANTSP algorithms are significantly reduced.
Approximate shortest path algorithms for network-tree model
2003-01-01
1440240 byte
Conference paper
Electronic Resource
English
Approximate Shortest Path Algorithms for Network-Tree Model
British Library Conference Proceedings | 2003
|Urban K shortest path obtaining method based on shortest path tree
European Patent Office | 2024
|Dual Shortest-Path Tree: Ideas and Methods
British Library Conference Proceedings | 2005
|Optimizing Drone Navigation Using Shortest Path Algorithms
Springer Verlag | 2024
|Improved shortest path algorithms for transport networks
Elsevier | 1977
|