The complexity of finding two disjoint paths with min-max objective function (Q584275): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Wai-Kai Chen / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C38 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C20 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 4134076 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
paths | |||
| Property / zbMATH Keywords: paths / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
vertex-disjoint | |||
| Property / zbMATH Keywords: vertex-disjoint / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
arc-disjoint | |||
| Property / zbMATH Keywords: arc-disjoint / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
NP-complete | |||
| Property / zbMATH Keywords: NP-complete / rank | |||
Normal rank | |||
Revision as of 18:31, 1 July 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of finding two disjoint paths with min-max objective function |
scientific article |
Statements
The complexity of finding two disjoint paths with min-max objective function (English)
0 references
1990
0 references
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.
0 references
paths
0 references
vertex-disjoint
0 references
arc-disjoint
0 references
NP-complete
0 references
