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

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 Õ(n^1/3) rounds and Õ(n^7/3) messages for a given undirected weighted graph of n nodes with the approximation facto...

Full description

Bibliographic Details

Published in:	International Symposium on Computing and Networking (Online) pp. 82 - 91
Main Authors:	Saikia, Parikshit, Karmakar, Sushanta
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.11.2019
Subjects:	Approximation algorithms Computational modeling CONGESTED CLIQUE distributed approximation algorithm Distributed computing Forestry Knowledge engineering shortest path forest Steiner tree Steiner trees
ISSN:	2379-1896
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!