Algorithms for rectilinear optimal multicast tree problem
Given a point s called the signal source and a set D of points called the sinks, a rectilinear multicast tree is defined as a tree T=(V, E) such that s ∃ V, D\(\subseteq\)V, and the length of each path on T from the source s to a sink t equals the L1-distance from s to t. A rectilinear multicast tree is said to be optimal if the total length of T is minimized. The optimal multicast tree (OMT) problem in general is NP-complete [1, 2, 4], while the complexity of the rectilinear version is still open. In this paper, we present algorithms to solve the rectilinear optimal multicast tree (ROMT) problem. Our algorithms require O(n3k) and O(n23 n ) time, where n denotes ¦D¦ and k is the number of dominating layers defined by s.
Unable to display preview. Download preview PDF.
- 1.H.-A. Choi and A.-H. Esfahanian (1989) ”The Complexity of Optimal Distance-Preserving trees,” MSU-CPS-ACS-18, Technical Report of Department of Computer Science, Michigan State University.Google Scholar
- 2.H.-A. Choi, A.-H. Esfahanian and B. C. Houck (1988) ”Optimal Communication Trees with Application to Hypercube Multicomputer,” Proceedings of the Sixth International conference on the Theory and Application of Graph Theory.Google Scholar
- 3.S. E. Dreyer and R. A. Wagner, (1972) ”The Steiner Problem in Graphs,” Networks, vol. 1, pp. 195–207.Google Scholar
- 4.X. Lin and L. M. Ni, (1989) ”Some Theoretical Results on Multicast Communications,” MSU-CPS-ACS-17, Technical Report of Department of Computer Science, Michigan State University.Google Scholar