作者: Marek Chrobak , Leszek Gąsieniec , Wojciech Rytter
关键词:
摘要: We present an O(n log4n)-time randomized algorithm for gossiping in radio networks with unknown topology. This is the first this model whose running time only a poly-logarithmic factor away from optimum. The fastest previously known (deterministic) problem works O(n3/2 log2 n).