On the complexity of the edge-disjoint min-min problem in planar digraphs (Q428855)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of the edge-disjoint min-min problem in planar digraphs |
scientific article; zbMATH DE number 6049381
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the edge-disjoint min-min problem in planar digraphs |
scientific article; zbMATH DE number 6049381 |
Statements
On the complexity of the edge-disjoint min-min problem in planar digraphs (English)
0 references
25 June 2012
0 references
min-min problem
0 references
planar digraph
0 references
NP-complete
0 references
disjoint path
0 references
inapproximability
0 references
