Approximation algorithms and hardness of integral concurrent flow

DOI10.1145/2213977.2214040zbMath1286.05060OpenAlexW2107396513MaRDI QIDQ5415510

Alina Ene, Julia Chuzhoy, Shi Li, Parinya Chalermsook

Publication date: 13 May 2014

Published in: Proceedings of the forty-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

zbMATH Keywords

integral concurrent flow

Mathematics Subject Classification ID

Connectivity (05C40) Randomized algorithms (68W20) Flows in graphs (05C21)

Related Items (1)

Routing with congestion in acyclic digraphs

This page was built for publication: Approximation algorithms and hardness of integral concurrent flow