Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
DOI10.1145/1103963.1103967zbMath1321.68386OpenAlexW2004240896WikidataQ56077951 ScholiaQ56077951MaRDI QIDQ2944499
Balaji Raghavachari, Raja Jothi
Publication date: 2 September 2015
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1103963.1103967
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) Approximation algorithms (68W25)
Related Items (13)
This page was built for publication: Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design