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

翻译：最小偏心最短路径问题在于在给定的无方向图中找到一条最短路径,其中最小偏心。 在理想偏心方面,这个问题已知为NP-完整和W[2]-硬。 我们为按模块宽度、离群集图的距离、距离至偏心偏心路径断开的路径的结合以及最大叶数测定的问题提供了假算法。