Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.