1 citations · 1 across the 4 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2026
The Complexity of Distributed Minimum Weight Cycle Approximation
Yi-Jun Chang, Yanyu Chen, Dipan Dey +4
We study the Minimum Weight Cycle (MWC) problem in the model of distributed computing. For undirected weighted graphs, we give a randomized -approximation…
cs.DC2024
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.…