Pages that link to "Item:Q5917535"

The following pages link to Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5917535):

Displayed 14 items.

• On the Max-flow min-cut ratio for directed multicommodity flows (Q818146) ‎ (← links)
• Finding disjoint paths with related path costs (Q857785) ‎ (← links)
• Exact and approximate resolution of integral multiflow and multicut problems: Algorithms and complexity (Q926573) ‎ (← links)
• The maximum edge-disjoint paths problem in complete graphs (Q930909) ‎ (← links)
• Flows with unit path capacities and related packing and covering problems (Q1041430) ‎ (← links)
• Minimum \(k\) arborescences with bandwidth constraints (Q1879251) ‎ (← links)
• Hardness and approximation results for packing Steiner trees (Q2369873) ‎ (← links)
• Finding edge-disjoint paths in networks: an ant colony optimization algorithm (Q2466394) ‎ (← links)
• Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation (Q2638376) ‎ (← links)
• The maximum integer multiterminal flow problem in directed graphs (Q2643793) ‎ (← links)
• On the disjoint paths problem (Q2643811) ‎ (← links)
• Dynamic routing and wavelength assignment for multi-lightpath demands (Q3023252) ‎ (← links)
• Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms (Q3656863) ‎ (← links)
• Approximability of Packing Disjoint Cycles (Q5387766) ‎ (← links)