Improved distributed Steiner Forest construction

Christoph Lenzen, Boaz Patt-Shamir

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present new distributed algorithms for constructing a Steiner Forest in the CONGEST model. Our deterministic algorithm finds, for any given constant ε > 0, a (2 + ε)approximation in Ö(sk + √min {st, n}) rounds, where s is the shortest path diameter, t is the number of terminals, k is the number of terminal components in the input, and n is the number of nodes. Our randomized algorithm finds, with high probability, an O(log n)-approximation in time O(k + min{s, √n} + D), where D is the unweighted diameter of the network. We also prove a matching lower bound of Ω(k + min {s, √n} + D) on the running time of any distributed approximation algorithm for the Steiner Forest problem. Previous algorithms were randomized, and obtained either an O(log n)-approximation in O(sk) time, or an O(l/ε)-approximation in Õ((√n + t)1+ε + D) time.

Original languageEnglish
Title of host publicationPODC 2014 - Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing
Pages262-271
Number of pages10
DOIs
StatePublished - 2014
Event2014 ACM Symposium on Principles of Distributed Computing, PODC 2014 - Paris, France
Duration: 15 Jul 201418 Jul 2014

Publication series

NameProceedings of the Annual ACM Symposium on Principles of Distributed Computing

Conference

Conference2014 ACM Symposium on Principles of Distributed Computing, PODC 2014
Country/TerritoryFrance
CityParis
Period15/07/1418/07/14

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Improved distributed Steiner Forest construction'. Together they form a unique fingerprint.

Cite this