An unconditional lower bound on the time-approximation trade-off for the distributed minimum spanning tree problem

Research output: Contribution to journalArticlepeer-review

65 Scopus citations

Abstract

The design of distributed approximation protocols is a relatively new and rapidly developing area of research. However, so far, little progress has been made 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 trade-off of the distributed minimum spanning tree problem, and show some of its variants.

Original languageEnglish
Pages (from-to)433-456
Number of pages24
JournalSIAM Journal on Computing
Volume36
Issue number2
DOIs
StatePublished - 1 Dec 2006

Keywords

  • Distributed algorithms
  • Hardness of approximation
  • Minimum spanning tree

Fingerprint

Dive into the research topics of 'An unconditional lower bound on the time-approximation trade-off for the distributed minimum spanning tree problem'. Together they form a unique fingerprint.

Cite this