1. Y. Bartal, Probabilistic approximation of metric spaces and its algorithmic applications, in: Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 184–1963.
2. Multi-source spanning tree problems;Farley;J. Interconnect. Netw.,2000
3. Optimum communication spanning trees;Hu;SIAM J. Comput.,1974
4. The complexity of the network design problem;Johnson;Networks,1978
5. A faster strongly polynomial minimum cost flow algorithm;Orlin;Oper. Res.,1993