11 citations · 29 across the 22 of their papers we have counts for
5 papers · 1 filter
Plane Gossip: Approximating rumor spread in planar graphs
Jennifer Iglesias, Rajmohan Rajaraman, R Ravi +1
We study the design of schedules for multi-commodity multicast; we are given an undirected graph and a collection of source destination pairs, and the goal is to schedule a min…
Information Spreading in Dynamic Networks under Oblivious Adversaries
John Augustine, Chen Avin, Mehraneh Liaee +2
We study the problem of gossip in dynamic networks controlled by an adversary that can modify the network arbitrarily from one round to another, provided that the network is always…
Asymptotically Optimal Approximation Algorithms for Coflow Scheduling
Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman
Many modern datacenter applications involve large-scale computations composed of multiple data flows that need to be completed over a shared set of distributed resources. Such a co…
Balls and Funnels: Energy Efficient Group-to-Group Anycasts
Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi +1
We introduce group-to-group anycast (g2g-anycast), a network design problem of substantial practical importance and considerable generality. Given a collection of groups and requir…
Better bounds for coalescing-branching random walks
Michael Mitzenmacher, Rajmohan Rajaraman, Scott Roche
Coalescing-branching random walks, or {\em cobra walks} for short, are a natural variant of random walks on graphs that can model the spread of disease through contacts or the spre…