This thesis also gives algorithms for some single source path problems. We obtain the first linear time algorithm for the single source minimum nondecreasing paths problem. We give some extensions to this, including an algorithm to find cheapest minimum nondecreasing paths.Chapter 6 Nondecreasing Paths We consider the problem of planning a train trip so that we arrive at our destination as early as possible. The travel booking office has a timetable with departure and arrival times for all scheduled trains, together with their origins and destinations. Prom this data, we ... into one for SSNP. Incidentally, Moorea#39;s algorithm strikingly resembles the Bellman-Ford algorithm [8 , 41].
|Title||:||Efficient Algorithms for Path Problems in Weighted Graphs|
|Publisher||:||ProQuest - 2008|