Broadcast Networks with Near Optimal Cost
Broadcasting is a basic problem of communication in usual networks. Many papers have investigated the construction of minimum broadcast networks, the cheapest possible network architecture (having the fewest communication lines), in which broadcasting can be accomplished as fast as theoretically possible from any vertex. Other papers considered the problem of determining the minimum broadcast time of a given vertex in an arbitrary network. In this paper, for given n we construct optimal networks on n vertices which we define to be the product of the broadcast time and the number of edges of the network. On the way we start the study of an interesting problem, the problem of minimum time broadcasting in networks with given number of vertices and edges.
KeywordsBroadcast minimum broadcast graph optimal networks
Unable to display preview. Download preview PDF.
- 5.Elkin, M., Kortsarz, G.: Sublogarithmic approximation for telephone multicast: path out of jungle. In: SODA 2003, Baltimore, pp. 76–85 (2003)Google Scholar
- 6.Elkin, M., Kortsarz, G.: A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem. In: Proc. of ACM Symp. on Theory of Computing, pp. 438–447 (2002)Google Scholar
- 20.Khachatrian, L.H., Haroutunian, H.S.: Construction of new classes of minimal broadcast networks. In: Proceedings 3rd International Colloquium on Coding Theory, Dilijan, Armenia, pp. 69–77 (1990)Google Scholar
- 21.Khachatrian, L.H., Haroutunian, H.S.: Minimal broadcast trees. In: XIV All-Union School of Computer Networks, Minsk, USSR, pp. 36–40 (1989) (in Russian)Google Scholar
- 26.Ravi, R.: Rapid rumor ramification: Approximating the minimum broadcast time. In: Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS 1994), pp. 202–213 (1994)Google Scholar