Login / Signup
Parikshit Saikia
ORCID
Publication Activity (10 Years)
Years Active: 2017-2024
Publications (10 Years): 9
Top Topics
Approximation Algorithms
Traveling Salesman
Prize Collecting
Steiner Tree
Top Venues
CoRR
CANDAR
DCOSS-IoT
Int. J. Found. Comput. Sci.
</>
Publications
</>
Parikshit Saikia
An O(1)-rounds Deterministic Distributed Approximation Algorithm for the Traveling Salesman Problem in Congested Clique.
DCOSS-IoT
(2024)
Parikshit Saikia
,
Sushanta Karmakar
,
Aris Pagourtzis
Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree.
Discret. Math. Algorithms Appl.
13 (2) (2021)
Parikshit Saikia
,
Sushanta Karmakar
Improved distributed approximation for Steiner tree in the CONGEST model.
J. Parallel Distributed Comput.
158 (2021)
Parikshit Saikia
,
Sushanta Karmakar
Round-Message Trade-Off in Distributed Steiner Tree Construction in the CONGEST Model.
ICDCIT
(2020)
Parikshit Saikia
,
Sushanta Karmakar
Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE.
Int. J. Found. Comput. Sci.
31 (7) (2020)
Parikshit Saikia
,
Sushanta Karmakar
2(1 - 1/ℓ)-Factor Steiner Tree Approximation in Õ(n^1/3) Rounds in the CONGESTED CLIQUE.
CANDAR
(2019)
Parikshit Saikia
,
Sushanta Karmakar
Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE.
CoRR
(2019)
Parikshit Saikia
,
Sushanta Karmakar
model.
ICDCN
(2019)
Parikshit Saikia
,
Sushanta Karmakar
A Primal-Dual based Distributed Approximation Algorithm for Prize Collecting Steiner Tree.
CoRR
(2017)