Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem

Michael Elkin
2004 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04  
The design of distributed approximation protocols is a relatively new rapidly developing area of research. However, so far little progress was done in the study of the hardness of distributed approximation. In this paper we initiate the systematic study of this subject, and show strong unconditional lower bounds on the time-approximation tradeoff of the distributed minimum spanning tree problem, and some of its variants.
doi:10.1145/1007352.1007407 dblp:conf/stoc/Elkin04 fatcat:6y7k2lp4tjbdzo7af65buplj2i