Designing multi-commodity flow trees
From MaRDI portal
Publication:1321837
DOI10.1016/0020-0190(94)90044-2zbMath0803.68087arXivcs/0205077OpenAlexW2599142459MaRDI 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
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)
Related Items (6)
Better hardness results for the minimum spanning tree congestion problem ⋮ Characterizing graphs of small carving-width ⋮ Minimum restricted diameter spanning trees. ⋮ Minimum congestion spanning trees in planar graphs ⋮ Meet and merge: approximation algorithms for confluent flows ⋮ On spanning tree congestion of graphs
Cites Work
This page was built for publication: Designing multi-commodity flow trees