Approximation schemes for fractional multicommodity flow problems
From MaRDI portal
Publication:4635999
zbMATH Open1393.90018MaRDI QIDQ4635999FDOQ4635999
Authors: George Karakostas 
Publication date: 23 April 2018
Recommendations
- Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
- Approximating fractional multicommodity flow independent of the number of commodities
- Fast and simple approximation schemes for generalized flow.
- Faster approximation schemes for fractional multicommodity flow problems
- Fast approximation algorithms for multicommodity flow problems
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)
Cited In (6)
- Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules
- Flows with unit path capacities and related packing and covering problems
- 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
- Faster approximation schemes for fractional multicommodity flow problems
- On fractional multicommodity flows and distance functions
This page was built for publication: 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 Q4635999)
