Routing algorithms play a vital role in network communication for information technology.
Classic networks usually exploit distributed routing algorithms which pave the way to issues …

We study network coding gaps for the problem of makespan minimization of multiple
unicasts. In this problem distinct packets at different nodes in a network need to be delivered …

This paper considers network communications under a hard timeliness constraint, where a
source node streams perishable information to a destination node over a directed acyclic …

In the minimum Multicut problem, the input is an edge-weighted supply graph G=(V, E) and a
demand graph H=(V, F). Either G and H are directed (Dir-MülC) or both are undirected …

We consider the communication capacity of wireline networks for a two-unicast traffic
pattern. The network has two sources and two destinations with each source communicating …

We study the multiway cut problem in directed graphs and one of its special cases, the node-
weighted multiway cut problem in undirected graphs. In Directed Multiway Cut (Dir-MC) the …

We prove tight network topology dependent bounds on the round complexity of computing
well studied k-party functions such as set disjointness and element distinctness. Unlike the …

Supporting delay-sensitive traffic is critical to the next-generation communication network.
This work studies the 1-to-2 broadcast packet erasure channels with causal …

The modern computation and information processing systems shaping our world have
become massively distributed and a fundamental understanding of distributed algorithmics …

We investigate the approximability of the linear 3-cut problem in directed graphs, which is
the simplest unsolved case of the linear k-cut problem. The input here is a directed graph …