(Almost) tight bounds and existence theorems for confluent flows

DOI10.1145/1007352.1007432zbMath1192.90022OpenAlexW2009190935MaRDI QIDQ3581008

Rajmohan Rajaraman, Adrian Vetta, Jiangzhuo Chen, Ravi Sundaram, László Lovász, Robert D. Kleinberg

Publication date: 15 August 2010

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

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Single-Sink Multicommodity Flow with Side Constraints ⋮ Traffic engineering of management flows by link augmentations on confluent trees

This page was built for publication: (Almost) tight bounds and existence theorems for confluent flows