From the 1 of 3 linked papers with an AI index.
3 papers
cs.DC2026
The Complexity of Distributed Minimum Weight Cycle Approximation
Yi-Jun Chang, Yanyu Chen, Dipan Dey +4
The paper presents randomized approximation algorithms for the Minimum Weight Cycle problem in the CONGEST model, achieving a trade‑off between approximation ratio and round comple…
cs.DC2025
Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
Yi-Jun Chang, Yanyu Chen, Gopinath Mishra
We consider the problem of constructing distributed overlay networks, where nodes in a reconfigurable system can create or sever connections with nodes whose identifiers they know.…
cs.DS2025
Optimal Distributed Replacement Paths
Yi-Jun Chang, Yanyu Chen, Dipan Dey +3
We study the replacement paths problem in the model of distributed computing. Given an - shortest path , the goal is to compute, for every edge in $…