Zahn, F.B., Noon, C.E.: Shortest path algorithms: An evaluation using real road networks. Transportation Science 32 (1998) 65--73 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Energy-Aware Routing in Cluster-Based Sensor Networks - Younis, Youssef, Arisha (2002) (5 citations) (Correct)
....defined as one to some shortest paths, while those paths from every node to every node is called all to all shortest paths [11] Our routing problem can be considered as the transpose of the one to some shortest path, since not all sensors are active simultaneously. A recent study by Zhan and Noon [13] suggested that the best approach for solving the one to some shortest path is Dijkstra s algorithm. In addition, Dijkstra s algorithm is shown to suit centralized routing [3] Therefore, we use Dijkstra s algorithm with the link cost dj for the link between the nodes i and j, redefined as d = 27k ....
F. Zhan, C. Noon, "Shortest Path Algorithms: An Evaluation Using Real Road Networks," Transportation Science, 1996.
Single Source Shortest Paths on Weighted Co-Interval Graphs - Sellmann (Correct)
.... solve the SSSP on directed acyclic graphs (see [1, 5] for an overview) But also more specialized algorithms for certain graph classes like weighted circular arc graphs have been studied (see [2] and di erent algorithms and implemenatations have been tested on real world data instances (see e.g. [12]) On top of that, incremental and dynamic methods have been developed to speed up the repeated solution of the SSSP on networks that are subject to minor changes from one iteration to the other (see [3, 10, 11] Although weighted co interval graphs play an important role when solving scheduling ....
F.B. Zhan, C.E. Noon. Shortest Path Algorithms: An Evaluation using Real Road Networks. Transportation Science, 32(1), 1988.
Optimizing Path Query Performance: Graph Clustering.. - Huang, Jing, Rundensteiner (2000) (Correct)
....is complimentary to data structure type of work. Similarly, there is also a body of literature on evaluating shortest path algorithms both in the database as well as in the GIS community. Focus here has been on a comparison of the performance of different types of shortest path algorithms itself [39], on on line reordering [24] or on a priori materialization of best paths [21] In [2] a multi level structure is proposed to prune the search space by conducting path precomputations within each component data structure. Such a technique is less useful for processing path queries with embedded ....
Zhan and Noon, 1998. Shortest path algorithms: an evaluation using real road networks, Transportation Science 32, 65-73.
A Multi-Criteria, Multi-Modal Passenger Route Advisory System - Meng, Yizhi, Wai, Chuin (Correct)
....Research Work State of the Art We begin with a brief summary of the state of the art in this and related research. The general problem of route planning has been widely investigated in the past decades and there are more than two thousand research papers on related topics (see [Zhao97] [ZhNo98] and [DePa84] However, most of the research efforts have focused on static, single mode transport systems [Zhao97] 2.2.1 Standard Algorithms for Shortest Path Problems The static, single mode transport system is generally modeled by a weighted, directed graph where the nodes are (major) ....
F. B. Zhan and C. E. Noon, "Shortest Path Algorithms: An Evaluation using Real Road Networks", Transportation Science, Vol 32, No. 1, Feb. 1998, pp. 65-73.
Geometric Speed-Up Techniques for Finding Shortest Paths in.. - Wagner, Willhalm (2003) (1 citation) (Correct)
No context found.
Zahn, F.B., Noon, C.E.: Shortest path algorithms: An evaluation using real road networks. Transportation Science 32 (1998) 65--73
Performance Evaluation of Load-Balanced Clustering of Wireless .. - Gupta, Younis (2003) (Correct)
No context found.
F. Zhan, C. Noon, Shortest Path Algorithms: An Evaluation Using Real Road Networks, Transportation Science, 1996.
A Practical Shortest Path Algorithm with Linear Expected Time - Goldberg (2001) (Correct)
No context found.
F. B. Zhan and C. E. Noon. Shortest Path Algorithms: An Evaluation using Real Road Networks.
Computing the Shortest Path: A* Search Meets Graph Theory - Goldberg, Harrelson (2004) (Correct)
No context found.
F. B. Zhan and C. E. Noon. Shortest Path Algorithms: An Evaluation using Real Road Networks. Transp. Sci., 32:65-73, 1998.
Experimental Analysis of Dynamic All Pairs Shortest.. - Demetrescu.. (2003) (1 citation) (Correct)
No context found.
F. Zhan and C. Noon. Shortest path algorithms: An evaluation using real road networks. Transportation Science, 32(1):65--73, 1998. 13
Directed Single-Source Shortest-Paths in Linear Average-Case Time - Meyer (2001) (Correct)
No context found.
F. B. Zhan and C. E. Noon. Shortest path algorithms: An evaluation using real road networks.
A Simple Shortest Path Algorithm with Linear Average Time - Goldberg (13 citations) (Correct)
No context found.
F. B. Zhan and C. E. Noon. Shortest Path Algorithms: An Evaluation using Real Road Networks. Transp. Sci., 32:65--73, 1998.
Shortest Path Algorithms: Engineering Aspects - Goldberg (2001) (4 citations) (Correct)
No context found.
F. B. Zhan and C. E. Noon. Shortest Path Algorithms: An Evaluation using Real Road Networks. Transp. Sci., 32:65--73, 1998.
CP-based Lagrangian Relaxation for a Multimedia Application - Sellmann, Fahle (2001) (1 citation) (Correct)
No context found.
F.B. Zhan, C.E. Noon. Shortest Path Algorithms: An Evaluation using Real Road Networks. Transportation Science, 32(1), 1988. 14
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC