Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference10 articles.
1. Agarwal, S., A.K. Mittal, and P. Sharma. (1984). “Constrained Optimum Communication Tree and Sensitivity Analysis.” SIAM J of Comput. 13, 315–328.
2. Ahuja, R.K and V.V.S. Murty. (1987). “Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem.” Transportation Science 21, 163–170.
3. Hu, T.C. (1974). “Optimum Communication Spanning Trees.” SIAM J of Comput. 3, 188–195.
4. Johnson, D.S, Lenstra and J.K. Rinooy Kan. (1987). “The Complexity of the Network Design Problem.” NETWORKS 8, 279–285.
5. Peleg, D. and E. Reshef. (1998). “Deterministic Polylog Approximation for Minimum Communication Spanning Trees.” Lecture Notes in Computer Science, 1443, Springer, Berlin, pp. 670–686.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献