Designing multi-commodity flow trees
From MaRDI portal
Publication:1321837
DOI10.1016/0020-0190(94)90044-2zbMath0803.68087arXivcs/0205077MaRDI QIDQ1321837
Samir Khuller, Balaji Raghavachari, Neal E. Young
Publication date: 3 May 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0205077
90C35: Programming involving graphs or networks
68R10: Graph theory (including graph drawing) in computer science
90B10: Deterministic network models in operations research
68W25: Approximation algorithms
Related Items
Minimum congestion spanning trees in planar graphs, On spanning tree congestion of graphs, Minimum restricted diameter spanning trees., Characterizing graphs of small carving-width, Meet and merge: approximation algorithms for confluent flows
Cites Work