Parikshit Saikia
Orcid: 0000-0001-6306-9994
According to our database1,
Parikshit Saikia
authored at least 8 papers
between 2017 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2017
2018
2019
2020
2021
2022
2023
2024
0
1
2
3
2
1
1
1
1
2
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
An O(1)-rounds Deterministic Distributed Approximation Algorithm for the Traveling Salesman Problem in Congested Clique.
Proceedings of the 20th International Conference on Distributed Computing in Smart Systems and the Internet of Things, 2024
2021
J. Parallel Distributed Comput., 2021
Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree.
Discret. Math. Algorithms Appl., 2021
2020
Int. J. Found. Comput. Sci., 2020
Round-Message Trade-Off in Distributed Steiner Tree Construction in the CONGEST Model.
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.
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.
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.
CoRR, 2017