On finding Min-Min disjoint paths (Q2375950)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6180787
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finding Min-Min disjoint paths |
scientific article; zbMATH DE number 6180787 |
Statements
On finding Min-Min disjoint paths (English)
0 references
25 June 2013
0 references
Min-Min problem
0 references
planar graph
0 references
NP-hardness
0 references
polynomial-time algorithm
0 references
shortest path
0 references
disjoint paths
0 references
0.9075619578361512
0 references
0.8941076397895813
0 references
0.8782358169555664
0 references
0.8775989413261414
0 references
0.8520730137825012
0 references
