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

Michael Elkin

doi:10.1145/1007352.1007407

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

Michael Elkin

Research output: Contribution to journal › Conference article › peer-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 language	English
Pages (from-to)	331-340
Number of pages	10
Journal	Conference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/1007352.1007407
State	Published - 1 Jan 2004
Externally published	Yes
Event	Proceedings of the 36th Annual ACM Symposium on Theory of Computing - Chicago, IL, United States Duration: 13 Jun 2004 → 15 Jun 2004

Keywords

Hardness of Approximation
Minimum Spanning Tree

ASJC Scopus subject areas

Software

Access to Document

10.1145/1007352.1007407

Cite this

@article{7beb95581e1e468688ba14dce0d007c6,

title = "Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem",

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

keywords = "Hardness of Approximation, Minimum Spanning Tree",

author = "Michael Elkin",

year = "2004",

month = jan,

day = "1",

doi = "10.1145/1007352.1007407",

language = "English",

pages = "331--340",

journal = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0734-9025",

publisher = "Association for Computing Machinery (ACM)",

note = "Proceedings of the 36th Annual ACM Symposium on Theory of Computing ; Conference date: 13-06-2004 Through 15-06-2004",

}

TY - JOUR

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

AU - Elkin, Michael

PY - 2004/1/1

Y1 - 2004/1/1

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

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

KW - Hardness of Approximation

KW - Minimum Spanning Tree

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

U2 - 10.1145/1007352.1007407

DO - 10.1145/1007352.1007407

M3 - Conference article

AN - SCOPUS:4544228797

SN - 0734-9025

SP - 331

EP - 340

JO - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Conference Proceedings of the Annual ACM Symposium on Theory of Computing

T2 - Proceedings of the 36th Annual ACM Symposium on Theory of Computing

Y2 - 13 June 2004 through 15 June 2004

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this