Comment:
Time taken for the gossip to come back?
Follow-up:
A circular gossiping loop is a round trip tour visiting each and every node once. The cost of such a tour is defined as the total costs summing up all the link costs. Each link cost can represent the time needed for the gossip message to travel from one node to another node.
Comment:
Why is there no fast algorithm for a round trip tour where each link and node is visited once?
Follow-up:
That is life, I guess. There are in fact many such seemingly simple problems that do not have a fast optimal algorithm for them yet.
No comments:
Post a Comment