Given an arbitrary rooted tree with n nodes, we wish to broadcast a message from the root to every node in the tree and minimize the overall broadcast time. In a step/round a node can send a message to exactly one of its children in the tree. In the next step/round both this node and the child (chosen in the previous step) can send the message to two different nodes. Can anyone give an efficient polynomial algorithm that minimizes the number of steps/rounds?
--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
