activity
20192021
most citedMinor Sparsifiers and the Distributed Laplacian Paradigm

5 citations · 8 across the 3 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.DS2021★ 2 cited

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing

Goran Zuzic, Gramoz Goranci, Mingquan Ye +2

We provide universally-optimal distributed graph algorithms for -approximate shortest path problems including shortest-path-tree and transshipment. The universal o…