Polylog Pairwise Poise: Approximating Multicommodity MulticastResearch Paper
In the synchronous telephone model, each vertex of a graph can exchange any number of messages with at most one neighbor per round. Multicommodity multicast asks, given source–sink pairs , to deliver each source's message to its sink within the minimum number of rounds. It generalizes the single-source problems known as…