Vitaly Rubinovich

Learn More
This paper presents a lower bound of ~ (D + p n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in n-vertex networks of diameter D = (logn), in the bounded message model. This establishes the asymptotic near-optimality of existing time-e cient distributed algorithms for the problem, whose complexity is O(D + p(More)
This paper presents a lower bound of Ω(D+ √ n/ logn) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of diameter D = Ω(logn), in the bounded message model. This establishes the asymptotic nearoptimality of existing time-efficient distributed algorithms for the problem, whose(More)
  • 1