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

Michael Elkin

doi:10.1137/S0097539704441058

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

Michael Elkin

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

70 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 language	English
Pages (from-to)	433-456
Number of pages	24
Journal	SIAM Journal on Computing
Volume	36
Issue number	2
DOIs	https://doi.org/10.1137/S0097539704441058
State	Published - 1 Dec 2006

Keywords

Distributed algorithms
Hardness of approximation
Minimum spanning tree

ASJC Scopus subject areas

Computer Science (all)
Mathematics (all)

Access to Document

10.1137/S0097539704441058

Cite this

@article{b536ab7b3acc48c2ab8b345e5ff8d99d,

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

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.",

keywords = "Distributed algorithms, Hardness of approximation, Minimum spanning tree",

author = "Michael Elkin",

year = "2006",

month = dec,

day = "1",

doi = "10.1137/S0097539704441058",

language = "English",

volume = "36",

pages = "433--456",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "2",

}

TY - JOUR

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

AU - Elkin, Michael

PY - 2006/12/1

Y1 - 2006/12/1

N2 - 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.

AB - 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.

KW - Distributed algorithms

KW - Hardness of approximation

KW - Minimum spanning tree

UR - http://www.scopus.com/inward/record.url?scp=34247209656&partnerID=8YFLogxK

U2 - 10.1137/S0097539704441058

DO - 10.1137/S0097539704441058

M3 - Article

AN - SCOPUS:34247209656

VL - 36

SP - 433

EP - 456

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

SN - 0097-5397

IS - 2

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this