Abstract
Let N=(V,E,c,l,p) be a network where V is the set of n vertices, E is the set of m edges, c(u,v)/spl ges/0 is the capacity of edge {u,v}, l(u,v)/spl ges/0 is the delay of edge {u,v}, p(u,v)/spl isin/[0,1] is the operational probability of edge {u,v}. In this letter, we present O(rm+rnlog n) time algorithms for the most reliable quickest path problem and the quickest most reliable path problem, where r is the number of different capacity values in the network.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
