Faster approximation schemes for fractional multicommodity flow problems
From MaRDI portal
Recommendations
- Faster approximation schemes for fractional multicommodity flow problems
- Approximating fractional multicommodity flow independent of the number of commodities
- Fast deterministic approximation for the multicommodity flow problem
- Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
- Fast approximation algorithms for multicommodity flow problems
Cited in
(15)- Multicommodity network flows: A survey. II: Solution methods
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
- Approximation schemes for fractional multicommodity flow problems
- Quadratically regularized optimal transport on graphs
- Max concurrent flow problem
- Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
- Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules
- Approximating fractional multicommodity flow independent of the number of commodities
- Solving Multicommodity Flow Problems by an Approximation Scheme
- Approximation guarantees of algorithms for fractional optimization problems arising in dispatching rules for INDS problems
- Efficient computation of optimal energy and fractional weighted flow trade-off schedules
- Approximating Fractional Packings and Coverings in O(1/epsilon) Iterations
- Faster approximation schemes for fractional multicommodity flow problems
- On fractional multicommodity flows and distance functions
This page was built for publication: Faster approximation schemes for fractional multicommodity flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4828929)
