J. Dossey, A. Otto, L. Spence, and C. Eynden Discrete Mathematics, Second Edition, Harper Collins College Publishers, 1993  Home/Search   Document Not in Database   Summary   Related Articles

....is to minimize the cost of each path from the source to each destination individually. In other words, shortest path tree tends to minimize the average cost per path. There are two old and well known algorithms for constructing shortest path tree, Bellman Ford algorithm [2] and Dijkstra algorithm [3]. The two algorithms compute the optimal solution in polynomial time execution. Bellman Ford is O(N ) where N is the number of nodes in the network, while Dijkstra is O(N ) A more recent algorithm for this problem is the reverse path forwarding (RBF) algorithm mentioned in [4] In RBF, ....

....it is not used practically. Widyono just proposed CBF to be used as a basis for several delay constrained minimum Steiner tree heuristics presented in the next section. Sun and Langendorefer [8] proposed a heuristic algorithm for delay constrained shortest path tree based on Dijkstra algorithm [3] called constrained Dijkstra algorithm (CDKS) CDKS first run Dijkstra algorithm to find the shortest path tree in terms of link s cost. If the resulted tree satisfied the delay constraint, then CDKS gets the optimal tree, otherwise, CDKS runs Dijkstra algorithm again but in terms of link s delay. ....

[Article contains additional citation context not shown here]

J. Dossey, A. Otto, L. Spence, and C. Eynden Discrete Mathematics, Second Edition, Harper Collins College Publishers, 1993

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