The following pages link to On finding Min-Min disjoint paths (Q2375950):
Displaying 16 items.
- Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths (Q328701) (← links)
- Finding paths with minimum shared edges (Q386426) (← links)
- On the complexity of the edge-disjoint min-min problem in planar digraphs (Q428855) (← links)
- On shortest disjoint paths in planar graphs (Q429668) (← links)
- The complexity of finding two disjoint paths with min-max objective function (Q584275) (← links)
- Finding disjoint paths with related path costs (Q857785) (← links)
- The minimum reload \(s-t\) path, trail and walk problems (Q987690) (← links)
- On the complexity of algorithms for detecting \(k\)-length negative cost cycles (Q2051903) (← links)
- Hardness of minimum barrier shrinkage and minimum installation path (Q2192386) (← links)
- Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints (Q2354302) (← links)
- Minimum-link paths revisited (Q2450201) (← links)
- Finding the Minimum-Weight k-Path (Q2842177) (← links)
- Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs (Q3004683) (← links)
- Efficient algorithms for minimal disjoint path problems on chordal graphs (Q4882587) (← links)
- Finding Minors in Graphs with a Given Path Structure (Q5251199) (← links)
- Algorithms and Computation (Q5897927) (← links)
