The Minimum Eccentricity Shortest Path Problem consists in finding a shortest path with minimum eccentricity given undirected graph. problem is known to be NP-complete and W[2]-hard respect the desired eccentricity. We present fpt-algorithms for parameterized by modular width, distance cluster graph, combination of treewidth eccentricity, maximum leaf number.

First, we define a stochastic shortest path problem (SSP) on Borel space considering the distribution of total cost. Next, for this SSP, policy classes are set number steps to reach terminal state first time, and is designed each class. There no guarantee that probability large cost small with expected value (expected cost). The minimizes or Conditional Value at Risk (CVaR) may not state. propo...

In this paper we study a variant of the shortest path problem in graphs: given a weighted graph G and vertices s and t, and given a set X of forbidden paths in G, find a shortest s-t path P such that no path in X is a subpath of P . Path P is allowed to repeat vertices and edges. We call each path in X an exception, and our desired path a shortest exception avoiding path. We formulate a new ver...