Pages that link to "Item:Q5917535"
From MaRDI portal
The following pages link to Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5917535):
Displayed 34 items.
- Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
- Tree metrics and edge-disjoint \(S\)-paths (Q463719) (← links)
- The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (Q520046) (← links)
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- Approximability of packing disjoint cycles (Q534781) (← links)
- Maximum bipartite flow in networks with adaptive channel width (Q541660) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- 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)
- Finding multiple induced disjoint paths in general graphs (Q1944193) (← links)
- Maximum edge-disjoint paths in planar graphs with congestion 2 (Q2039241) (← links)
- On some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines (Q2043623) (← links)
- Hardness and approximation results for packing Steiner trees (Q2369873) (← links)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← 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)
- Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations (Q2676343) (← links)
- Routing in Undirected Graphs with Constant Congestion (Q2817791) (← links)
- Randomized Rounding in the Presence of a Cardinality Constraint (Q2828177) (← 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)
- All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs (Q4577772) (← links)
- Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems (Q5136261) (← links)
- Approximability of Packing Disjoint Cycles (Q5387766) (← links)
- A logarithmic approximation for unsplittable flow on line graphs (Q5501955) (← links)
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators (Q5918431) (← links)
- On the approximability of time disjoint walks (Q5918517) (← links)
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators (Q5925650) (← links)