Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer SciencesVol.E89-ANo.2pp.544-550 Publication Date: 2006/02/01 Online ISSN: 1745-1337 DOI: 10.1093/ietfec/e89-a.2.544 Print ISSN: 0916-8508 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: shortest path, preprocessing, A* algorithm, routing,
Full Text: PDF(1.2MB)>>
Summary: The 2-terminal shortest path problem is to find a shortest path between two specified vertices in a given graph G. In this paper, we consider this problem in the following situation: G is given before the two vertices are specified so that some preprocessing is allowed to reduce the response time. We present a method for calculating lower bounds of the length of the shortest path for any pair of vertices. Experimental results show that the A* algorithm with our method performs much better than previous methods.