Plane Gossip: Approximating rumor spread in planar graphs

Lecture Notes in Computer Science, pp. 611-624, 2018.

Cited by: 0|Bibtex|Views37|DOI:https://doi.org/10.1007/978-3-319-77404-6_45
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

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

Code:

Data:

Your rating :
0

 

Tags
Comments