3 papers
cs.DC2019
Distributed Approximation Algorithms for Steiner Tree in the
Parikshit Saikia, Sushanta Karmakar
The \emph{Steiner tree} problem is one of the fundamental and classical problems in combinatorial optimization. In this paper, we study this problem in the $\…
cs.DC2017
A Primal-Dual based Distributed Approximation Algorithm for Prize-Collecting Steiner Tree
Parikshit Saikia, Sushanta Karmakar, Aris T. Pagourtzis
The Prize-Collecting Steiner Tree (PCST) problem is a generalization of the Steiner Tree problem that has applications in network design, content distribution networks, and many mo…
cs.DC2016
-shot Broadcasting in Ad Hoc Radio Networks
Sushanta Karmakar, Paraschos Koutris, Aris Pagourtzis +1
We study distributed broadcasting protocols with few transmissions (`shots') in radio networks where the topology is unknown. In particular, we examine the case in which a bound $k…