The complexity of finding two disjoint paths with min-max objective function (Q584275): Difference between revisions

The paper considers the problem of finding two disjoint paths from a given node s to another node t in a network such that the length of the longer path is minimized. The paths may be vertex-disjoint or arc- disjoint and the network may be directed or undirected. It is shown that all four versions as well as some related problems are strongly NP- complete. The paper also gives a pseudo-polynomial-time algorithm for the acyclic directed case.