Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow
From MaRDI portal
Recommendations
- Approximation algorithms for the unsplittable flow problem on paths and trees
- Approximation algorithms for the unsplittable flow problem
- scientific article; zbMATH DE number 1947047
- scientific article; zbMATH DE number 5899246
- A constant-factor approximation algorithm for unsplittable flow on paths
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
- A constant factor approximation algorithm for unsplittable flow on paths
- An Approximation Algorithm for Fully Planar Edge-Disjoint Paths
- scientific article; zbMATH DE number 1775441
Cited in
(10)- An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs
- Solving the edge‐disjoint paths problem using a two‐stage method
- Flows on few paths: Algorithms and lower bounds
- Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid
- Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems
- scientific article; zbMATH DE number 5899246 (Why is no real title available?)
- A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2
- Approximation algorithms for the unsplittable flow problem
- An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two
- Multicommodity flow in trees: packing via covering and iterated relaxation
This page was built for publication: Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5450805)
