Finding k-broadcast centers under postal model

The broadcasting problem is to find a broadcast center such that the transmission time from the center to all vertices is minimized. In this thesis, we consider k-broadcasting in weighted tree under postal model. In postal model, we have to create a links which cost -time before broadcasting a message, after the link created, the transmission begin without waiting other transmission complete, the term k-broadcast means the process of creating link from one vertex to at most k adjacent vertices can process simultaneously. In this thesis, the algorithm computes the set of k-broadcast centers and determines the broadcast time of the weighted tree in O(n) time.