3 years ago

# A Primal-Dual based Distributed Approximation Algorithm for Prize Collecting Steiner Tree.

Parikshit Saikia, Sushanta Karmakar

Constructing a steiner tree of a graph is a fundamental problem in many applications. Prize collecting steiner tree (PCST) is a special variant of the steiner tree problem and has applications in network design, content distribution etc. There are a few centralized approximation algorithms \cite{DB_MG_DS_DW_1993, GW_1995, AA_MB_MH_2011} for solving the PCST problem. However no distributed algorithm is known that solves the PCST problem with non-trivial approximation factor. In this work we present a distributed algorithm that constructs a prize collecting steiner tree for a given connected undirected graph with non-negative weight for each edge and non-negative prize value for each node. Initially each node knows its own prize value and weight of each incident edge. Our algorithm is based on primal-dual method and it achieves an approximation factor of $(2 - \frac{1}{n - 1})$ of the optimal. The total number of messages required by our distributed algorithm to construct the PCST for a graph with $|V|$ nodes and $|E|$ edges is $O(|V|^2 + |E||V|)$. The algorithm is spontaneously initiated at a special node called the root node and when the algorithm terminates each node knows whether it is in the prize part or in the steiner tree of the PCST.

Publisher URL: http://arxiv.org/abs/1710.07040

DOI: arXiv:1710.07040v1

You might also like
Never Miss Important Research

Researcher is an app designed by academics, for academics. Create a personalised feed in two minutes.
Choose from over 15,000 academics journals covering ten research areas then let Researcher deliver you papers tailored to your interests each day.

Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.