Parikshit Saikia

According to our database, Parikshit Saikia authored at least 8 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

An O(1)-rounds Deterministic Distributed Approximation Algorithm for the Traveling Salesman Problem in Congested Clique.

Parikshit Saikia

Proceedings of the 20th International Conference on Distributed Computing in Smart Systems and the Internet of Things, 2024

2021

Improved distributed approximation for Steiner tree in the CONGEST model.

Parikshit Saikia, Sushanta Karmakar

J. Parallel Distributed Comput., 2021

Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree.

Parikshit Saikia, Sushanta Karmakar, Aris Pagourtzis

Discret. Math. Algorithms Appl., 2021

2020

Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE.

Parikshit Saikia, Sushanta Karmakar

Int. J. Found. Comput. Sci., 2020

Round-Message Trade-Off in Distributed Steiner Tree Construction in the CONGEST Model.

Parikshit Saikia, Sushanta Karmakar

Proceedings of the Distributed Computing and Internet Technology, 2020

2019

A simple 2(1-1/<i>l</i>) factor distributed approximation algorithm for steiner tree in the <i>CONGEST</i> model.

Parikshit Saikia, Sushanta Karmakar

Proceedings of the 20th International Conference on Distributed Computing and Networking, 2019

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

Parikshit Saikia, Sushanta Karmakar

Proceedings of the 2019 Seventh International Symposium on Computing and Networking, 2019

2017

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

Parikshit Saikia, Sushanta Karmakar

CoRR, 2017