We consider the following Optimization version of GalacticShortest Paths.
Its input is a graph G, two vertices s and t of the graph, anonnegative length and a nonnegative risk for each edge, and abound L. We want to find a path from s to t of total length at mostL and minimum total risk. Suppose epsilon > 0. Give thespecification of a polynomial time approximation algorithm Approxwith ratio.
(1+ epsilon) for this problem.
Expert Answer
An answer will be send to you shortly. . . . .