A Primal-Dual based Distributed Approximation Algorithm for Prize Collecting Steiner Tree. - Parikshit Saikia; Sushanta Karmakar (CoRR, 2017)

2(1 - 1/ℓ)-Factor Steiner Tree Approximation in Õ(n^1/3) Rounds in the CONGESTED CLIQUE. - Parikshit Saikia; Sushanta Karmakar (CANDAR, 2019)

A simple 2(1-1/l) factor distributed approximation algorithm for steiner tree in the CONGEST model. - Parikshit Saikia; Sushanta Karmakar (ICDCN, 2019)

Round-Message Trade-Off in Distributed Steiner Tree Construction in the CONGEST Model. - Parikshit Saikia; Sushanta Karmakar (ICDCIT, 2020)

Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE. - Parikshit Saikia; Sushanta Karmakar (Int. J. Found. Comput. Sci., 2020)

Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree. - Parikshit Saikia; Sushanta Karmakar; Aris Pagourtzis (Discret. Math. Algorithms Appl., 2021)

Improved distributed approximation for Steiner tree in the CONGEST model. - Parikshit Saikia; Sushanta Karmakar (J. Parallel Distributed Comput., 2021)

An O(1)-rounds Deterministic Distributed Approximation Algorithm for the Traveling Salesman Problem in Congested Clique. - Parikshit Saikia (DCOSS-IoT, 2024)