The minimum vulnerability problem on specific graph classes

Suppose that each edge e of an undirected graph G is associated with three nonnegative integers $$\mathsf{cost}(e)$$ cost ( e ) , $$\mathsf{vul}(e)$$ vul ( e ) and $$\mathsf{cap}(e)$$ cap ( e ) , called the cost, vulnerability and capacity of e, respectively. Then, we consider the problem of finding $$k$$ k paths in G between two prescribed vertices with the minimum total cost; each edge e can be shared without any cost by at most $$\mathsf{vul}(e)$$ vul ( e ) paths, and can be shared by more than $$\mathsf{vul}(e)$$ vul ( e ) paths if we pay $$\mathsf{cost}(e)$$ cost ( e ) , but cannot be shared by more than $$\mathsf{cap}(e)$$ cap ( e ) paths even if we pay the cost for e. This problem generalizes the disjoint path problem, the minimum shared edges problem and the minimum edge cost flow problem for undirected graphs, and it is known to be NP-hard. In this paper, we study the problem from the viewpoint of specific graph classes, and give three results. We first show that the problem is NP-hard even for bipartite outerplanar graphs, 2-trees, graphs with pathwidth two, complete bipartite graphs, and complete graphs. We then give a pseudo-polynomial-time algorithm for bounded treewidth graphs. Finally, we give a fixed-parameter algorithm for chordal graphs when parameterized by the number $$k$$ k of required paths.