Faster approximation schemes for fractional multicommodity flow problems

DOI10.1145/1328911.1328924zbMath1446.90152OpenAlexW2020899710MaRDI QIDQ4962706

George Karakostas

Publication date: 5 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1328911.1328924

zbMATH Keywords

multicommodity flowsfully polynomial-time approximation schemes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Related Items (2)

Scalable timing-aware network design via Lagrangian decomposition ⋮ A generalized approximation framework for fractional network flow and packing problems

This page was built for publication: Faster approximation schemes for fractional multicommodity flow problems