Approximation schemes for fractional multicommodity flow problems

MaRDI QIDQ4635999zbMATH OpenFDO

Authors George Karakostas

Publication date 23 April 2018

zbMATH Keywords

directed networkoptimization problemcommodityfractional multicommodity flow problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

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

Cited in

(7)

• 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
• Multicommodity flows
• On fractional multicommodity flows and distance functions
• Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules
• Faster approximation schemes for fractional multicommodity flow problems
• Efficient computation of optimal energy and fractional weighted flow trade-off schedules

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)