Strongly polynomial algorithms for the unsplittable flow problem
From MaRDI portal
Recommendations
- Combinatorial algorithms for the unsplittable flow problem
- Approximation algorithms for the unsplittable flow problem
- A (5/3+)-approximation for unsplittable flow on a path: placing small tasks into boxes
- Approximation algorithms for the unsplittable flow problem
- Approximation algorithms for the unsplittable flow problem on paths and trees
Cited in
(15)- A note on the greedy algorithm for the unsplittable flow problem
- Call control with \(k\) rejections
- Combinatorial algorithms for the unsplittable flow problem
- Approximation algorithms for the unsplittable flow problem on paths and trees
- Improved bounds for the unsplittable flow problem
- A Polynomial Algorithm for Weighted Abstract Flow
- New Algorithms for the Unsplittable Flow Problem
- Approximation algorithms for the unsplittable flow problem
- Stochastic unsplittable flows
- Flows on few paths: Algorithms and lower bounds
- A logarithmic approximation for unsplittable flow on line graphs
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
- A fast heuristic algorithm for the maximum concurrent \(k\)-splittable flow problem
- An exact approach for the maximum concurrent \(k\)-splittable flow problem
- Maximizing residual capacity in connection-oriented networks
This page was built for publication: Strongly polynomial algorithms for the unsplittable flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537731)
