2(1 – 1/ℓ)-Factor Steiner Tree Approximation in Õ(n^1/3) Rounds in the CONGESTED CLIQUE

Parikshit Saikia,Sushanta Karmakar

doi:10.1109/candar.2019.00018

2(1 – 1/ℓ)-Factor Steiner Tree Approximation in Õ(n^1/3) Rounds in the CONGESTED CLIQUE

Parikshit Saikia, Sushanta Karmakar

https://doi.org/10.1109/candar.2019.00018

Copy DOI

Publication Date: Nov 1, 2019

Citations: 35

Affiliation: Indian Institute of Technology Guwahati

#Steiner Tree #CONGESTED CLIQUE Model + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

We study the Steiner tree problem in the CONGESTED CLIQUE model of distributed computing. We present a deterministic distributed approximation algorithm that computes a Steiner tree in O(n^1/3) rounds and O(n^7/3) messages for a given undirected weighted graph of n nodes with the approximation factor 2(1 - 1/l) of the optimal, where l is the number of terminal leaf nodes in the optimal Steiner tree. Note here that the O(⋅) notation hides polylogarithmic factors in n. To the best of our knowledge, this is the first work to study the Steiner tree problem in the CONGESTED CLIQUE model.

Full Text