Let N = (V, A, c, l) be an input network with node set V, arc set A, positive arc weight function c and nonnegative arc weight function l. Let σ be the amount of data to be transmitted. The quickest path problem is to find a routing path in N to transmit the given amount of data in minimum time. In a recent paper, Chen and Chin proposed this problem and developed algorithms for the single pair quickest path problem with time complexity O(re + rn log n), where n = |V|, e = |A|, and r is the number of distinct capacity values of N. In this paper, we first develop an alternative algorithm for the single pair quickest path problem with same time complexity and less space requirement. We then study the constrained quickest path problem and propose an O(re + rn log n) time algorithm. Finally, we develop an algorithm to enumerate the first m quickest paths to send a given amount of data from one node to another with time complexity O(rmne + rmn2 log n).
ASJC Scopus subject areas
- Computer Science(all)
- Modeling and Simulation
- Management Science and Operations Research