Meet and merge

DOI10.1145/780542.780598zbMath1192.90220OpenAlexW2070767236MaRDI QIDQ3581299

Ravi Sundaram, Jiangzhuo Chen, Rajmohan Rajaraman

Publication date: 16 August 2010

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

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation algorithms (68W25)

Related Items (4)

Single-Sink Multicommodity Flow with Side Constraints ⋮ Traffic engineering of management flows by link augmentations on confluent trees ⋮ Meet and merge: approximation algorithms for confluent flows ⋮ Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems

This page was built for publication: Meet and merge