5 citations · 20 across the 12 of their papers we have counts for
1 paper · 1 filter
Christoph Lenzen, Boaz Patt-Shamir
We describe a distributed randomized algorithm computing approximate distances and routes that approximate shortest paths. Let n denote the number of nodes in the graph, and let HD…