Pages that link to "Item:Q857785"
From MaRDI portal
The following pages link to Finding disjoint paths with related path costs (Q857785):
Displaying 8 items.
- Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths (Q328701) (← links)
- On the complexity of the edge-disjoint min-min problem in planar digraphs (Q428855) (← links)
- Building edge-failure resilient networks (Q818826) (← links)
- Efficient algorithms for shared backup allocation in networks with partial information (Q857776) (← links)
- An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks (Q2146374) (← links)
- Improved approximation algorithms for computing \(k\) disjoint paths subject to two constraints (Q2354302) (← links)
- On finding Min-Min disjoint paths (Q2375950) (← links)
- Hardness of Finding Two Edge-Disjoint Min-Min Paths in Digraphs (Q3004683) (← links)