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

Research output: Contribution to journalConference articlepeer-review

62 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)331-340
Number of pages10
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs
StatePublished - 1 Jan 2004
Externally publishedYes
EventProceedings of the 36th Annual ACM Symposium on Theory of Computing - Chicago, IL, United States
Duration: 13 Jun 200415 Jun 2004

Keywords

  • Hardness of Approximation
  • Minimum Spanning Tree

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem'. Together they form a unique fingerprint.

Cite this