Abstract
Optimum Communication Spanning Tree Problem is a special case of the Network Design Problem. In this problem given a graph, a set of requirements r ij and a set of distances d ij for all pair of nodes (i,j), the cost of communication for a pair of nodes (i,j), with respect to a spanning tree T is defined as r ij times the length of the unique path in T, that connects nodes i and j. Total cost of communication for a spanning tree is the sum of costs for all pairs of nodes of G. The problem is to construct a spanning tree for which the total cost of communication is the smallest among all the spanning trees of G. The problem is known to be NP-hard. Hu (1974) solved two special cases of the problem in polynomial time. In this paper, using Hu’s result the first algorithm begins with a cut-tree by keeping all d ij equal to the smallest d ij . For arcs (i,j) which are part of this cut-tree the corresponding d ij value is increased to obtain a near optimal communication spanning tree in pseudo-polynomial time.
In case the distances d ij satisfy a generalised triangle inequality the second algorithm in the paper constructs a near optimum tree in polynomial time by parametrising on the r ij .
Similar content being viewed by others
References
Agarwal, S., A.K. Mittal, and P. Sharma. (1984). “Constrained Optimum Communication Tree and Sensitivity Analysis.” SIAM J of Comput. 13, 315–328.
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.
Hu, T.C. (1974). “Optimum Communication Spanning Trees.” SIAM J of Comput. 3, 188–195.
Johnson, D.S, Lenstra and J.K. Rinooy Kan. (1987). “The Complexity of the Network Design Problem.” NETWORKS 8, 279–285.
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.
Rothlauf, F., J, Gerstacker, and A. Heinzl. (2003). “On the Optimal Communication Spanning Tree Problem.” Working Paper 10/2003, Maastricht University (DONET), May 2003. 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.
Hu, T.C. (1974). “Optimum Communication Spanning Trees”, SIAM J of Comput., 3, 188-195.
Johnson, D.S, Lenstra and J.K. Rinooy Kan. (1987). “ The Complexity of the Network Design Problem”, NETWORKS, 8, 279-285.
Peleg, D, and E. Reshef. (1998). “ Deterministic Polylog Approximation for Minimum Communication Spanning Trees”, Lecture Notes in Computer Science, 1443, Springer, Berlin, 670-686.
Rothlauf, F, Gerstacker, J and A. Heinzl. (2003). “ On the Optimal Communication Spanning Tree Problem”, Working Paper 10/2003,Maastricht University (DONET), May 2003.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sharma, P. Algorithms for the optimum communication spanning tree problem. Ann Oper Res 143, 203–209 (2006). https://doi.org/10.1007/s10479-006-7382-1
Issue Date:
DOI: https://doi.org/10.1007/s10479-006-7382-1