TY - GEN
T1 - Improved distributed Steiner Forest construction
AU - Lenzen, Christoph
AU - Patt-Shamir, Boaz
PY - 2014
Y1 - 2014
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84905457510&partnerID=8YFLogxK
U2 - https://doi.org/10.1145/2611462.2611464
DO - https://doi.org/10.1145/2611462.2611464
M3 - منشور من مؤتمر
SN - 9781450329446
T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
SP - 262
EP - 271
BT - PODC 2014 - Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing
T2 - 2014 ACM Symposium on Principles of Distributed Computing, PODC 2014
Y2 - 15 July 2014 through 18 July 2014
ER -