This paper presents near-optimal deterministic parallel and distributed algorithms for computing
(1+eps)-approximate single-source shortest paths in any undirected weighted graph. On …

The packet routing problem asks to select routing paths that minimize the maximum edge
congestion for a set of packets specified by source-destination vertex pairs. We revisit a semi-…

… [33] Bernhard Haeupler, Taisuke Izumi, and Goran Zuzic. Near-optimal … [35] Bernhard Haeupler,
Jason Li, and Goran Zuzic. Minor … [36] Bernhard Haeupler, David Wajc, and Goran Zuzic. …

We provide universally-optimal distributed graph algorithms for (1+∊)-approximate shortest
path problems including shortest-path-tree and transshipment. The universal optimality of …

We present a universally-optimal distributed algorithm for the exact weighted min-cut. The
algorithm is guaranteed to complete in Õ(D + √n ) rounds on every graph, recovering the …

We show that many distributed network optimization problems can be solved much more
efficiently in structured and topologically simple networks. It is known that solving essentially …

This paper introduces stronger notions for approximate single-source shortest-path
distances and gives simple reductions to compute them from weaker standard notions of …

We prove the existence of an oblivious routing scheme that is poly(logn)-competitive in
terms of (congestion + dilation), thus resolving a well-known question in oblivious routing. …

Distributed optimization algorithms are frequently faced with solving sub-problems on
disjoint connected parts of a network. Unfortunately, the diameter of these parts can be …

Distributed network optimization problems, such as minimum spanning tree, minimum cut,
and shortest path, are an active research area in distributed computing. This paper presents a …