Plane Gossip: Approximating rumor spread in planar graphs
Lecture Notes in Computer Science, pp. 611-624, 2018.
We study the design of schedules for multi-commodity multicast. In this problem, we are given an undirected graph G and a collection of source-destination pairs, and the goal is to schedule a minimum-length sequence of matchings that connects every source with its respective destination. The primary communication constraint of the multi-c...More
Full Text (Upload PDF)
PPT (Upload PPT)