there are some N robots in a field and the physical orientation is known(i.ethier location/distance-with-others). a robot can send a message at a given time only to 3 of them. you have a source robot and u have a message from this source which is to be broadcasted to all the robot. how to broadcast so that the total distance covered by the messages is minimal. a second version of problem is instead of minimising the total distance, you have to minimise the duplication(i.e same robot getting message more than once) i hrd this problem thru a friend and dunno the solution . so feel free to make reasonable assumptions but state them
for the first constraint i have thought abt minimum spanning tree but it wudnt work as any robot can send only to 3 other robots so, we are limiting the outdegree and also this seems to like routing algorithms except that its more static one. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
