On Constant Multi-Commodity Flow-Cut Gaps for Families of Directed Minor-Free Graphs

DOI10.1137/1.9781611975482.34zbMath1434.05065arXiv1711.01370OpenAlexW4240107753MaRDI QIDQ5236215

Anastasios Sidiropoulos, Vijay Sridhar, Ario Salmasi

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1711.01370

zbMATH Keywords

algorithmdecompositionembeddingnormed spacemulticommodity flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Graph minors (05C83) Flows in graphs (05C21)

Related Items (1)

Cut-sufficient directed 2-commodity multiflow topologies

This page was built for publication: On Constant Multi-Commodity Flow-Cut Gaps for Families of Directed Minor-Free Graphs