EFFICIENT HEURISTICS FOR MESSAGE DISSEMINATION IN NETWORKS

摘要

We present here a heuristic for broadcasting and a heuristic for gossiping. These heuristics outperform the previous heuristics in several network generators. The heuristic for gossiping also has a lower time complexity than the best heuristic in practice.