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

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

The single-source shortest-path (SSSP) problem is a notoriously hard problem in the
parallel context. In practice, the Δ-stepping algorithm of Meyer and Sanders has been widely …

Hybrid networks, ie, networks that leverage different means of communication, become ever
more widespread. To allow theoretical study of such networks,[Augustine et al., SODA'20] …

Time-sensitive software-defined networking (TSSDN) is an emerging technology that
combines the real-time network configuration capabilities of software-defined networking …

The HYBRID model, introduced in [Augustine et al., SODA'20], provides a theoretical
foundation for networks that allow multiple communication modes. The model follows the …

We consider the problem of computing shortest paths in hybrid networks, in which nodes
can make use of different communication modes. For example, mobile phones may use ad …

We show how to construct an overlay network of constant degree and diameter O (log n) in
time O (log n) starting from an arbitrary weakly connected graph. We assume a synchronous …

More and more networks are becoming reconfigurable: not just the routing can be
programmed, but the physical layer itself as well. Various technologies enable this …

The $\mathsf {HYBRID} $ model was introduced as a means for theoretical study of
distributed networks that use various communication modes. Conceptually, it is a …